Optimal and near-optimal mixed covering arrays by column expansion

DOI10.1016/j.disc.2007.11.021zbMath1169.05308OpenAlexW2084459727MaRDI QIDQ998340

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

zbMATH Keywords

orthogonal arraycovering arrayordered designLatin ordered designmixed covering array

Mathematics Subject Classification ID

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

Related Items (3)

Covering array EXtender ⋮ Mixed covering arrays of strength three with few factors ⋮ Cover starters for covering arrays of strength two

Cites Work

• On the maximum number of qualitative independent partitions
• Orthogonal arrays. Theory and applications
• Strength two covering arrays: existence tables and projection
• 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
• Orthogonal partitions and covering of graphs
• Covering arrays with mixed alphabet sizes
• Products of mixed covering arrays of strength two
• Orthogonal Arrays of Index Unity

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