New optimal covering arrays using an orderly algorithm

DOI10.1142/S1793830918500118zbMath1404.05021MaRDI QIDQ4603878

Idelfonso Izquierdo-Marquez, Jose Torres-Jimenez

Publication date: 23 February 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

non-isomorphic covering arrayscovering arrays of minimum lexicographical orderisomorphic covering arraysoptimal covering arrays

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Combinatorics in computer science (68R05) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (3)

Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods ⋮ Covering array EXtender ⋮ New covering array numbers

Cites Work

• Structures and lower bounds for binary covering arrays
• A survey of binary covering arrays
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• Covering and radius-covering arrays: constructions and classification
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Construction of non-isomorphic covering arrays
• Small latin squares, quasigroups, and loops
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Orthogonal Arrays of Index Unity
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New optimal covering arrays using an orderly algorithm