Skip to main content
SpringerLink
Log in

Constructing heterogeneous hash families by puncturing linear transversal designs

  • Published:
Journal of Geometry Aims and scope Submit manuscript

Abstract

Constructions that use hash families to select columns from small covering arrays in order to construct larger ones can exploit heterogeneity in the numbers of symbols in the rows of the hash family. For specific distributions of numbers of symbols, the efficacy of the construction is improved by accommodating more columns in the hash family. Known constructions of such heterogeneous hash families employ finite geometries and their associated transversal designs. Using thwarts in transversal designs, specific constructions of heterogeneous hash families are developed, and some open questions are posed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Barwick S.G., Jackson W.-A.: A sequence approach to linear perfect hash families. Des. Codes Cryptogr. 45, 95–121 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Barwick S.G., Jackson W.-A.: Geometric constructions of optimal linear perfect hash families. Finite Fields Appl. 14, 1–13 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Barwick S.G., Jackson W.-A., Quinn C.T.: Optimal linear perfect hash families with small parameters. J. Combin. Des. 12, 311–324 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bierbrauer J., Schellwat H.: Almost independent and weakly biased arrays: efficient constructions and cryptologic applications. Lecture Notes in Computer Science 1880, 533–543 (2000)

    Article  MathSciNet  Google Scholar 

  6. Blackburn S.R.: Perfect hash families: probabilistic methods and explicit constructions. J. Combin. Theory (A) 92, 54–60 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bruen A.A., Colbourn C.J.: Transversal designs in classical planes and spaces. J. Combin. Theory Ser. A 92(1), 88–94 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bruen A.A., Thas J.A.: Blocking sets. Geom. Dedicata 6, 193–203 (1977)

    MathSciNet  MATH  Google Scholar 

  9. Bush K.A.: Orthogonal arrays of index unity. Ann. Math. Stat. 23, 426–434 (1952)

    Article  MathSciNet  MATH  Google Scholar 

  10. Cohen D.M., Dalal S.R., Fredman M.L., Patton G.C.: The AETG system: an approach to testing based on combinatorial design. IEEE Trans. Softw. Eng. 23, 437–444 (1997)

    Article  Google Scholar 

  11. Cohen D.M., Dalal S.R., Parelius J., Patton G.C.: The combinatorial design approach to automatic test generation. IEEE Softw. 13, 82–88 (1996)

    Article  Google Scholar 

  12. Cohen, M.B., Colbourn, C.J., Gibbons, P.B., Mugridge, W.B.: Constructing test suites for interaction testing. In: Proceedings of the International Conference on Software Engineering (ICSE 2003), IEEE, pp. 38–48. Los Alamitos (2003)

  13. Cohen M.B., Dwyer M.B., Shi J.: Constructing interaction test suites for highly-configurable systems in the presence of constraints: a greedy approach. IEEE Trans. Softw. Eng. 34, 633–650 (2008)

    Article  Google Scholar 

  14. Colbourn C.J.: Combinatorial aspects of covering arrays. Le Matematiche (Catania) 58, 121–167 (2004)

    Google Scholar 

  15. Colbourn C.J.: Distributing hash families and covering arrays. J. Combin. Inf. Syst. Sci. 34, 113–126 (2009)

    Google Scholar 

  16. Colbourn, C.J.: Covering array tables (2010). http://www.public.asu.edu/~ccolbou/src/tabby

  17. Colbourn C.J.: Covering arrays and hash families. In: Crnkovic, D., Tonchev, V (eds) Information Security, Coding Theory, and Related Combinatorics, NATO science for peace and security series, pp. 99–135. IOS Press, Amsterdam (2011)

    Google Scholar 

  18. Colbourn C.J., Dinitz J.H.: Making the MOLS table. In: Wallis, W.D. (eds) Computational and Constructive Design Theory, pp. 67–134. Kluwer, Dordrecht (1996)

    Google Scholar 

  19. Colbourn C.J., Dinitz J.H.: Mutually orthogonal latin squares: A brief survey of constructions. J. Stat. Plann. Inference 95, 9–48 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  20. Colbourn, C.J., Dinitz, J.H. (eds): Handbook of combinatorial designs, Second edition. Chapman and Hall, Boca Raton (2007)

    Google Scholar 

  21. Colbourn C.J., Dinitz J.H., Stinson D.R.: More thwarts in transversal designs. Finite Fields Appl. 2, 293–303 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  22. Colbourn C.J., Dinitz J.H., Wojtas M.: Thwarts in transversal designs. Des. Codes Cryptogr. 5, 189–197 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  23. Colbourn C.J., Ling A.C.H.: Linear hash families and forbidden configurations. Des. Codes Cryptogr. 59, 25–55 (2009)

    Article  MathSciNet  Google Scholar 

  24. Colbourn C.J., Ling A.C.H.: A recursive construction for perfect hash families. J. Math. Cryptol. 3, 291–306 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  25. Colbourn C.J., McClary D.W.: Locating and detecting arrays for interaction faults. J. Combin. Optim. 15, 17–48 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  26. Colbourn C.J., Torres-Jiménez J.: Heterogeneous hash families and covering arrays. Contemp. Math. 523, 3–15 (2010)

    Google Scholar 

  27. Colbourn C.J., Zhou, J.: Improving two recursive constructions for covering arrays. J. Stat. Theory Pract. (to appear)

  28. Czech Z.J., Havas G., Majewski B.S.: Perfect hashing. Theoret. Comput. Sci. 182, 1–143 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  29. Damaschke P.: Adaptive versus nonadaptive attribute-efficient learning. Mach. Learn. 41, 197–215 (2000)

    Article  MATH  Google Scholar 

  30. Davenport H.: On the addition of residue classes. J. Lond. Math. Soc. 10, 30–32 (1935)

    Article  Google Scholar 

  31. Dinitz J.H., Ling A.C.H., Stinson D.R.: Perfect hash families from transversal designs. Australas. J. Combin. 37, 233–242 (2007)

    MathSciNet  MATH  Google Scholar 

  32. Forbes M., Lawrence J., Lei Y., Kacker R.N., Kuhn D.R.: Refining the in-parameter-order strategy for constructing covering arrays. J. Res. Nat. Inst. Stand. Tech. 113, 287–297 (2008)

    Google Scholar 

  33. Greig M.: Designs from projective planes and PBD bases. J. Combin. Des. 7, 341–374 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  34. Hartman A.: Software and hardware testing using combinatorial covering suites. In: Golumbic, M.C., Hartman, I.B.-A. (eds) Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, pp. 237–266. Springer, Norwell (2005)

    Chapter  Google Scholar 

  35. Hedayat A.S., Sloane N.J.A., Stufken J.: Orthogonal arrays. Springer, New York (1999)

    Book  MATH  Google Scholar 

  36. Hirschfeld J.W.P.: Finite projective spaces of three dimensions, Oxford Mathematical Monographs. Oxford University Press, New York (1985)

    Google Scholar 

  37. Hirschfeld J.W.P.: Projective geometries over finite fields, Second edition, Oxford Mathematical Monographs. Oxford University Press, New York (1998)

    Google Scholar 

  38. Hirschfeld J.W.P., Storme L.: The packing problem in statistics, coding theory and finite projective spaces, J. Stat. Plann. Inference 72, 355–380 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  39. Hirschfeld, J.W.P., Storme, L.: The packing problem in statistics, coding theory and finite projective spaces: update 2001. In: Finite geometries, Dev. Math., vol. 3, pp. 201–246. Kluwer, Dordrecht (2001)

  40. Hirschfeld J.W.P., Thas J.A.: General Galois geometries, Oxford Mathematical Monographs. Oxford University Press, New York (1991)

    Google Scholar 

  41. Hou, M., Berman, P., Zhang, L., Miller, W.: Controlling size when aligning multiple genomic sequences with duplications. In: Bücher, P., Moret, B.M.E. (eds.) Proceedings of the 6th Workshop on Algorithms in Bioinformatics (WABI ’06), pp. 138–149. Springer, Heidelberg (2006)

  42. Kemperman J.H.B.: On small sumsets in an abelian group. Acta Math. 103, 63–88 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  43. Kessel, R., Kacker, R.: A test of linearity using covering arrays for evaluating uncertainty in measurement. In: Advanced Mathematical and Computational Tools in Metrology and Testing, pp. 195–203. World Scientific, Singapore (2008)

  44. MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes II. North-Holland Mathematical Library, vol. 16. North-Holland Publishing, Amsterdam (1977)

  45. Martínez, C., Moura, L., Panario, D., Stevens, B.: Locating errors using ELAs, covering arrays, and adaptive testing algorithms. SIAM J. Discret. Math. 23, 1776–1799 (2009/10)

    Google Scholar 

  46. Martirosyan S.S., Van Trung T.: On t-covering arrays. Des. Codes Cryptogr. 32, 323–339 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  47. Martirosyan S.S., Van Trung T.: Explicit constructions for perfect hash families. Des. Codes Cryptogr. 46, 97–112 (2008)

    Article  MathSciNet  Google Scholar 

  48. Ronneseth A.H., Colbourn C.J.: Merging covering arrays and compressing multiple sequence alignments. Discret. Appl. Math. 157, 2177–2190 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  49. Shasha D., Kouranov A., Lejay L., Chou M., Coruzzi G.: . Plant Physiol.127, 1590–1594 (2001)

    Article  Google Scholar 

  50. Stevens B., Mendelsohn E.: Packing arrays and packing designs. Des. Codes Cryptogr. 27, 165–176 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  51. Stevens B., Mendelsohn E.: Packing arrays. Theoret. Comput. Sci. 321, 125–148 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  52. Turán P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436–452 (1941)

    MathSciNet  MATH  Google Scholar 

  53. Walker R.A. II, Colbourn C.J.: Perfect hash families: constructions and existence. J. Math. Cryptol. 1, 125–150 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  54. Yilmaz C., Cohen M.B., Porter A.: Covering arrays for efficient fault characterization in complex configuration spaces. IEEE Trans. Softw. Eng. 31, 20–34 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CIDSE, Arizona State University, P. O. Box 878809, Tempe, AZ, 85287-8809, USA

    Charles J. Colbourn

Authors
  1. Charles J. Colbourn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Charles J. Colbourn.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Colbourn, C.J. Constructing heterogeneous hash families by puncturing linear transversal designs. J. Geom. 101, 99–113 (2011). https://doi.org/10.1007/s00022-011-0083-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00022-011-0083-1

Keywords

Search

Navigation