TY - GEN
T1 - Binary covering arrays and existentially closed graphs
AU - Colbourn, Charles
AU - Kéri, Gerzson
PY - 2009/9/10
Y1 - 2009/9/10
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=69849115197&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=69849115197&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-01877-0_3
DO - 10.1007/978-3-642-01877-0_3
M3 - Conference contribution
AN - SCOPUS:69849115197
SN - 3642018130
SN - 9783642018138
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 22
EP - 33
BT - Coding and Cryptology - Second International Workshop, IWCC 2009, Proceedings
T2 - 2nd International Workshop on Coding and Cryptology, IWCC 2009
Y2 - 1 June 2009 through 5 June 2009
ER -