Covering arrays of strength three

DOI10.1023/A:1008379710317zbMath0938.05017OpenAlexW2168583313MaRDI QIDQ1299897

M. A. Chateauneuf, Donald L. Kreher, Charles J. Colbourn

Publication date: 22 November 1999

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008379710317

zbMATH Keywords

perfect hash familygroup actionorthogonal arraycovering array

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (19)

Problems and algorithms for covering arrays ⋮ Mixed covering arrays on graphs of small treewidth ⋮ Roux-type constructions for covering arrays of strengths three and four ⋮ Covering arrays on product graphs ⋮ Mixed covering arrays on 3-uniform hypergraphs ⋮ Consecutive detecting arrays for interaction faults ⋮ Locating and detecting arrays for interaction faults ⋮ An extension of a construction of covering arrays ⋮ Improved strength four covering arrays with three symbols ⋮ Constructing strength three covering arrays with augmented annealing ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) ⋮ New covering array numbers ⋮ Mixed covering arrays of strength three with few factors ⋮ Partial covering arrays: algorithms and asymptotics ⋮ Cover starters for covering arrays of strength two ⋮ Covering arrays on graphs ⋮ Upper Bounds on the Size of Covering Arrays ⋮ On the state of strength-three covering arrays

This page was built for publication: Covering arrays of strength three