Skip to main content
SpringerLink
Log in

On t-Covering Arrays

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

This paper concerns construction methods for t-covering arrays. Firstly, a construction method using perfect hash families is discussed by combining with recursion techniques and error-correcting codes. In particular, by using algebraic-geometric codes for this method we obtain infinite families of t-covering arrays which are proved to be better than currently known probabilistic bounds for covering arrays. Secondly, inspired from a result of Roux [16] and also from a recent result of Chateauneuf and Kreher [6] for 3-covering arrays, we present several explicit constructions for t-covering arrays, which can be viewed as generalizations of their results for t-covering arrays.

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. N. Alon, Explicit construction of exponential sized families of k-independent sets, Discrete Math., Vol. 58 (1986) pp. 191–193.

    Google Scholar 

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

    Google Scholar 

  3. C. J. Colbourn and J. H. Dinitz, CRC Handbook of Combinatorial Designs, CRC Press, Inc. (1996).

  4. M. Chateauneuf, Covering arrays, Ph.D. Thesis, Michigan Technological University (2000).

  5. M. Chateauneuf, C. J. Colbourn and D. L. Kreher, Covering arrays of strength 3, Designs, Codes and Cryptography, Vol. 16 (1999) pp. 235–242.

    Google Scholar 

  6. M. Chateauneuf and D. L. Kreher, On the state of strength-three covering arrays, J. Combin. Designs, Vol. 10 (2002) pp. 217–238.

    Google Scholar 

  7. P. Erdös, P. Frankl and Z. Füredi, Families of finite sets in which no set is covered by the union of r other, Israel Journal of Mathematics, Vol. 51 (1985) pp. 75–89.

    Google Scholar 

  8. L. Gargano, J. Körner and U. Vaccaro, Sperner capacities, Graphs and Combinatorics, Vol. 9 (1993) pp. 31–46.

    Google Scholar 

  9. A. Garcia and H. Stichtenoth, A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vlădut bound, Invent. Math., Vol. 121 (1995) pp. 211–222.

    Google Scholar 

  10. A. Garcia and H. Stichtenoth, On asymptotic behavior of some towers of function fields over finite fields, J. Number Theory, Vol. 61 (1996) pp. 248–273.

    Google Scholar 

  11. A. P. Godbole, D. E. Skipper and R. A. Sunley, t-Covering arrays: Upper bounds and Poisson approximations, Combinatorics, Probab. Comput., Vol. 5 (1966) pp. 105–117.

    Google Scholar 

  12. A. S. Hedayat, N. J. A. Sloane and J. Stufken, Orthogonal Arrays, Theory and applications, Springer (1999).

  13. G. O. H. Katona, Two applications (for search theory and truth functions) of Spencer type theorems, Periodica Math. Hung., Vol. 3 (1973) pp. 19–26.

    Google Scholar 

  14. D. J. Kleitman and J. Spencer, Families of k-independent sets, Discr. Math., Vol. 6 (1973) pp. 255–262.

    Google Scholar 

  15. A. Rényi, Foundation of Probability, Wiley, New York (1971).

    Google Scholar 

  16. G. Roux, k-propriété s dans des tableaux de n colonnes; cas particulier de la k-surjectivité et de la k-permutivité, Ph.D. dissertation, University of Paris, 6 March (1987).

  17. N. J. A. Sloane, Covering arrays and intersection codes, J. Combin Designs, Vol. 1 (1993) pp. 51–63.

    Google Scholar 

  18. K. W. Shum, I. Aleshnikov, P. V. Kumar, H. Stichtenoth and V. Deolalikar, A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound, IEEE Trans. Inform Theory, Vol. 47 (2001) pp. 2225–2241.

    Google Scholar 

  19. G. Sherwood, Constrained arrays test system (CATS), AT&T Bell Laboratories, Murray Hill, NJ, User's Manual (1992).

  20. G. Sherwood, Construction of orthogonal arrays and covering arrays using permutation groups, http://home.att.net/gsherwood/cover.htm.

  21. B. Stevens, L. Moura and E. Mendelsohn, Lower bounds for transversal covers, Designs, Codes and Cryptography, Vol. 15 (1998) pp. 279–299.

    Google Scholar 

  22. J. N. Staddon, D. R. Stinson and R. Wei, Combinatorial properties of frameproof and traceability codes, IEEE Trans. Inform. Theory, Vol. 47 (2001) pp. 1042–1049

    Google Scholar 

  23. D. R. Stinson, R. Wei and L. Zhu, New constructions for perfect hash families and related structures using combinatorial designs and codes, J. Combin. Designs, Vol. 8 (2000) pp. 189–200.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Experimental Mathematics, University of Duisburg-Essen, Ellernstrasse 29, 45326, Essen, Germany

    Sosina Martirosyan & van Tran Trung

Authors
  1. Sosina Martirosyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. van Tran Trung
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martirosyan, S., Trung, v. On t-Covering Arrays. Designs, Codes and Cryptography 32, 323–339 (2004). https://doi.org/10.1023/B:DESI.0000029232.40302.6d

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:DESI.0000029232.40302.6d

Search

Navigation