Largest induced subgraphs of the n-cube that contain no. 4-cycles
Journal of Combinatorial Theory Series B
Classification of Hadamard matrices of order 28
Discrete Mathematics
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
On an adjacency property of almost all graphs
Discrete Mathematics - Special issue on the 17th british combinatorial conference selected papers
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
Schütte's Tournament Problem and Intersecting Families of Sets
Combinatorics, Probability and Computing
Designs, Codes and Cryptography
Constraint Models for the Covering Test Problem
Constraints
Roux-type constructions for covering arrays of strengths three and four
Designs, Codes and Cryptography
Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)
Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)
IPOG: A General Strategy for T-Way Software Testing
ECBS '07 Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems
A density-based greedy algorithm for higher strength covering arrays
Software Testing, Verification & Reliability
Iterative exhaustive pattern generation for logic testing
IBM Journal of Research and Development
Upper bounds for covering arrays by tabu search
Discrete Applied Mathematics
New bounds for binary covering arrays using simulated annealing
Information Sciences: an International Journal
Randomized post-optimization of covering arrays
European Journal of Combinatorics
Supercomputing and grid computing on the verification of covering arrays
The Journal of Supercomputing
| Hi-index | 0.00 |
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.