- Home

[1] N. Alon, Explicit construction of exponential sized families of k-independent sets, Discrete Math., 58 (1986), 191-193

[2] M. Atici, S. S. Magliveras, D. R. Stinson, W. D. Wei, Some recursive constructions for perfect hash families, J. Combin. Des., 4 (1996), 353-363

[3] M. Atici, D. R. Stinson, R. Wei, A New Practical Algorithm for the Construction of a Perfect Hash Function,

[4] S. R. Blackburn, Perfect Hash Families with Few Functions, preprint

[5] S. R. Blackburn, "Combinatorics and threshold cryptography" Combinatorial designs and their applications, Chapman and Hall Research Notes in Mathematics, 403 (1999), 49-70

[6] S. R. Blackburn, Perfect hash families: probabilistic methods and explicit constructions, J. Comb. Theory - Series A, 92 (2000), 54-60

[7] E. F. Brickell, A Problem in Broadcast Encryption., Presented at the Fifth Vermont Seminar Workshop on Combinatorics and Graph Theory, 1991

[8] C. J. Colbourn, Manuscript in preparation, , 2006

[9] Sosina Martirosyan, Manuscript in preparation,

[10] Sosina Martirosyan, Perfect Hash Families, Identifiable Parent Property Codes and Covering Arrays, Ph.D. Dissertation, 2003

[11] D. R. Stinson, R. Wei, L. Zhu, New constructions for perfect hash families using combinatorial designs and codes, J. Combin. Designs, 8 (2000), 189-200

[12] Tran Van Trung, Sosina Martirosyan, New Constructions for IPP Codes, Des. Codes Cryptogr., to appear

[13] Unattributed, Basic PHF Facts, source unknown

[14] R. A. Walker II, Manuscript in preparation,

[15] R. A. Walker II, C. J. Colbourn, Perfect Hash Families: Constructions and Existence, preprint, 2006

[16] I. M. Wanless, A partial latin square problem posed by Blackburn., Bull. Inst. Comb. Appl., 42 (2004), 76-80