On t-Covering Arrays

Authors:
Sosina Martirosyan;Tran Van Trung
Affiliations:
Institute for Experimental Mathematics, University of Duisburg-Essen, Ellernstrasse 29, 45326 Essen, Germany sosina@exp-math.uni-essen.de;Institute for Experimental Mathematics, University of Duisburg-Essen, Ellernstrasse 29, 45326 Essen, Germany trung@exp-math.uni-essen.de
Venue:
Designs, Codes and Cryptography
Year:
2004

Citing 6
Cited 15

Explicit construction of exponential sized families of K-independent sets

Discrete Mathematics
Lower Bounds for Transversal Covers

Designs, Codes and Cryptography
Covering Arrays of Strength Three

Designs, Codes and Cryptography
Covering arrays

Covering arrays
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory
A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound

IEEE Transactions on Information Theory

Roux-type constructions for covering arrays of strengths three and four

Designs, Codes and Cryptography
Explicit constructions for perfect hash families

Designs, Codes and Cryptography
A backtracking search tool for constructing combinatorial test suites

Journal of Systems and Software
Covering arrays of strength 3 and 4 from holey difference matrices

Designs, Codes and Cryptography
Linear hash families and forbidden configurations

Designs, Codes and Cryptography
Merging covering arrays and compressing multiple sequence alignments

Discrete Applied Mathematics
Binary Covering Arrays and Existentially Closed Graphs

IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Memetic algorithms for constructing binary covering arrays of strength three

EA'09 Proceedings of the 9th international conference on Artificial evolution
Covering arrays generation methods survey

ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
A heuristic approach for constructing ternary covering arrays using trinomial coefficients

IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
A survey of methods for constructing covering arrays

Programming and Computing Software
New bounds for binary covering arrays using simulated annealing

Information Sciences: an International Journal
Optimal shortening of covering arrays

MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Randomized post-optimization of covering arrays

European Journal of Combinatorics
Mixed optimization combinatorial method for constructing covering arrays

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

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.