Structures and lower bounds for binary covering arrays

DOI10.1016/j.disc.2012.06.013zbMath1248.05018arXiv1111.0587OpenAlexW2066821750MaRDI QIDQ449145

Hyun Kwang Kim, Dong Yeol Oh, Soohak Choi

Publication date: 12 September 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.0587

zbMATH Keywords

Erdős-Ko-Rado theoremcovering arraysRoux's bound

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)

Related Items

New optimal covering arrays using an orderly algorithm, New covering array numbers, Arrays for combinatorial interaction testing: a review on constructive approaches, Perfect sets of paths in the full graph of SDN switches

Uses Software

• AETG

Cites Work

• Largest induced subgraphs of the n-cube that contain no 4-cycles
• Covering and radius-covering arrays: constructions and classification
• Universal classes of hash functions
• Lower bounds for transversal covers
• Upper bounds for covering arrays by tabu search.
• A classification of the structures of some Sperner families and superimposed codes
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• Oblivious transfers and intersecting codes
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Subquadratic zero-knowledge
• On Representatives of Subsets
• Covering arrays and intersecting codes
• Intersecting codes and independent families
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item