Recursive constructions for t-covering arrays

DOI10.3969/J.ISSN.1003-7985.2011.03.022MaRDI QIDQ2887176zbMATH OpenFDO

Authors Rijun Zha, Deping Zhang, Baowen Xu

Publication date 1 June 2012

Published in Journal of Southeast University. English Edition (Search for Journal in Brave)

zbMATH Keywords

difference matrixorthogonal arraycovering array

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Recommendations

• On t-covering arrays
• Recursive constructions of covering arrays
• Constructions of covering arrays of strength five
• Improving two recursive constructions for covering arrays
• Roux-type constructions for covering arrays of strengths three and four

Cited in

(8)

• Resolvable covering arrays
• Covering arrays from cyclotomy
• Recursive constructions of covering arrays
• Recursive constructions for large caps
• Improving two recursive constructions for covering arrays
• On t-covering arrays
• Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets
• Covering arrays from m-sequences and character sums

This page was built for publication: Recursive constructions for \(t\)-covering arrays

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