Abstract
Binary covering arrays have been extensively studied in many different contexts, but the explicit construction of small binary covering arrays with strength larger than three remains poorly understood. Connections with existentially closed graphs and Hadamard matrices are examined, particularly those arising from the Paley graphs and tournaments. Computational results on arrays generated by column translation, such as the Paley graphs, lead to substantial improvements on known existence results for binary covering arrays of strengths four and five. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Colbourn, C. J., & Kéri, G. (2009). Binary covering arrays and existentially closed graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5557 LNCS, pp. 22–33). https://doi.org/10.1007/978-3-642-01877-0_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
