Optimal and near-optimal mixed covering arrays by column expansion

DOI10.1016/J.DISC.2007.11.021zbMATH Open1169.05308OpenAlexW2084459727MaRDI QIDQ998340FDOQ998340

George B. Sherwood

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.021

Recommendations

• Constructions of mixed covering arrays with strength \( \ge 3\)
• Covering arrays with mixed alphabet sizes
• Mixed covering arrays of strength three with few factors
• scientific article
• Mixed covering arrays on graphs

zbMATH Keywords

orthogonal arraycovering arrayordered designLatin ordered designmixed covering array

Mathematics Subject Classification ID

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

Cites Work

• Orthogonal arrays. Theory and applications
• Strength two covering arrays: existence tables and projection
• Products of mixed covering arrays of strength two
• Orthogonal Arrays of Index Unity
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• On the state of strength-three covering arrays
• Covering arrays with mixed alphabet sizes
• On the maximum number of qualitative independent partitions
• Orthogonal partitions and covering of graphs

Cited In (4)

• Covering array EXtender
• Cover starters for covering arrays of strength two
• Mixed covering arrays of strength three with few factors
• Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)

This page was built for publication: Optimal and near-optimal mixed covering arrays by column expansion

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