Constructions of covering arrays of strength five

Authors:
Lijun Ji;Yang Li;Jianxing Yin
Affiliations:
Department of Mathematics, Soochow University, Suzhou, China 215006;Department of Mathematics, Soochow University, Suzhou, China 215006;Department of Mathematics, Soochow University, Suzhou, China 215006
Venue:
Designs, Codes and Cryptography
Year:
2012

Citing 10
Cited 0

Design theory

Design theory
Largest induced subgraphs of the n-cube that contain no. 4-cycles

Journal of Combinatorial Theory Series B
Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes

Designs, Codes and Cryptography
Construction for optimal optical orthogonal codes

Discrete Mathematics - Papers on the occasion of the 65th birthday of Alex Rosa
Combinatorial Designs: Constructions and Analysis

Combinatorial Designs: Constructions and Analysis
Constructions of difference covering arrays

Journal of Combinatorial Theory Series A
Roux-type constructions for covering arrays of strengths three and four

Designs, Codes and Cryptography
Covering arrays of strength 3 and 4 from holey difference matrices

Designs, Codes and Cryptography
Randomized Postoptimization of Covering Arrays

Combinatorial Algorithms
Constructions of new orthogonal arrays and covering arrays of strength three

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

A covering array of size N, strength t, degree k and order v, or a CA(N; t, k, v) in short, is an N 脳 k array on v symbols. In every N 脳 t subarray, each t-tuple occurs in at least one row. Covering arrays have been studied for their significant applications to generating software test suites to cover all t-sets of component interactions. In this paper, we present two constructive methods to obtain covering arrays of strength 5 by using difference covering arrays and holey difference matrices with a prescribed property. As a consequence, some new upper bounds on the covering numbers are derived.