Recursive constructions of covering arrays

MaRDI QIDQ5488390zbMATH OpenFDO

Authors Sosina S. Martirosyan, Charles J. Colbourn

Publication date 14 September 2006

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)

Recommendations

• Group construction of covering arrays
• Recursive constructions for t-covering arrays
• New covering array numbers
• Constructions of covering arrays of strength five
• Covering arrays of strength three

Cited in

(18)

• Merging covering arrays and compressing multiple sequence alignments
• Recursive constructions for large caps
• Randomized post-optimization of covering arrays
• On t-covering arrays
• New covering array numbers
• A construction of variable strength covering arrays
• Improving two recursive constructions for covering arrays
• Locating and detecting arrays for interaction faults
• Recursive constructions for t-covering arrays
• Sequence Covering Arrays and Linear Extensions
• Covering the Recursive Sets
• scientific article; zbMATH DE number 5177325 (Why is no real title available?)
• Group construction of covering arrays
• Subspace restrictions and affine composition for covering perfect hash families
• Binary Covering Arrays and Existentially Closed Graphs
• New families of strength-3 covering arrays using linear feedback shift register sequences
• Tabu search for covering arrays using permutation vectors
• Covering arrays from cyclotomy

This page was built for publication: Recursive constructions of covering arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488390)