Optimal and near-optimal mixed covering arrays by column expansion

DOI10.1016/J.DISC.2007.11.021MaRDI QIDQ998340zbMATH OpenOpenAlexFDO

Authors 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)

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; zbMATH DE number 5556019
• Mixed covering arrays on graphs

Cites work

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

Cited in

(8)

• Cost-efficient mixed-level covering designs for testing experiments
• Cover starters for covering arrays of strength two
• Mixed covering arrays of strength three with few factors
• D-optimal designs with interaction coverage
• Mixed optimization combinatorial method for constructing covering arrays
• Covering array EXtender
• Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)
• Constructions of mixed covering arrays with strength \( \ge 3\)

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)