On t-covering arrays

Designs, Codes, and Cryptography

Volumn 32, Issue 1-3, 2004, Pages 323-339

  Martirosyan, Sosina ^a   Van Trung, Tran ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

Algebraic geometric codes; Orthogonal arrays; Perfect hash families; t covering arrays

Indexed keywords

ALGEBRA; PROBABILITY; RECURSIVE FUNCTIONS; SET THEORY; THEOREM PROVING;

ALGEBRAIC-GEOMETRIC CODES; ORTHOGONAL ARRAYS; PERFECT HASH FAMILIES; T-COVERING ARRAYS;

CRYPTOGRAPHY;

EID: 3543136508     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:DESI.0000029232.40302.6d     Document Type: Conference Paper

References (23)

1. N. Alon, Explicit construction of exponential sized families of k-independent sets, Discrete Math., Vol. 58 (1986) pp. 191-193.
2. K. A. Bush, Orthogonal arrays of index unity, Ann. Math. Stat., Vol. 23 (1952) pp. 426-434.
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.
6. M. Chateauneuf and D. L. Kreher, On the state of strength-three covering arrays, J. Cambin. Designs, Vol. 10 (2002) pp. 217-238.
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.
8. L. Gargano, J. Körner and U. Vaccaro, Sperner capacities, Graphs and Combinatorics, Vol. 9 (1993) pp. 31-46.
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.
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.
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.
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.
14. D. J. Kleitman and J. Spencer, Families of k-independent sets, Discr. Math., Vol. 6 (1973) pp. 255-262.
15. A. Rényi, Foundation of Probability, Wiley, New York (1971).
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.
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.
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.
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
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.