New Constructions for Perfect Hash Families andRelated Structures using Combinatorial

@inproceedings{Stinson1999NewCF,
  title={New Constructions for Perfect Hash Families andRelated Structures using Combinatorial},
  author={DesignsD. R. Stinson},
  year={1999}
}
  • DesignsD. R. Stinson
  • Published 1999
In this paper, we consider explicit constructions of perfect hash families using combi-natorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and Wei 3]. Using similar methods, we also obtain eecient constructions for separating hash families which result in improved existence results for structures such as separating systems, key… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
34 Extracted Citations
7 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-7 of 7 references

New combinatorial designsand their application to group testing

  • H. Pesotan, D. Raghavarao
  • J . Statist . Plan . Infer
  • 1998

On super - simple 2 - ( v ; 4 ;  ) designs

  • R. C. Mullin
  • J . Combin . Math . Combin . Comput .
  • 1996

A simple construction for orthogonal Latin rectangles

  • J. Shiue
  • J . of Combin . Math . Combin . Comput .
  • 1988

Similar Papers

Loading similar papers…