Binary covering arrays and existentially closed graphs

Charles Colbourn, Gerzson Kéri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationCoding and Cryptology - Second International Workshop, IWCC 2009, Proceedings
Pages22-33
Number of pages12
DOIs
StatePublished - Sep 10 2009
Event2nd International Workshop on Coding and Cryptology, IWCC 2009 - Zhangjiajie, China
Duration: Jun 1 2009Jun 5 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5557 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Workshop on Coding and Cryptology, IWCC 2009
Country/TerritoryChina
CityZhangjiajie
Period6/1/096/5/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Binary covering arrays and existentially closed graphs'. Together they form a unique fingerprint.

Cite this