On the state of strength‐three covering arrays
- 1 January 2002
- journal article
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 10 (4), 217-238
- https://doi.org/10.1002/jcd.10002
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Perfect Hash Families: Probabilistic Methods and Explicit ConstructionsJournal of Combinatorial Theory, Series A, 2000
- The AETG system: an approach to testing based on combinatorial designIEEE Transactions on Software Engineering, 1997
- The combinatorial design approach to automatic test generationIEEE Software, 1996
- Oblivious transfers and intersecting codesIEEE Transactions on Information Theory, 1996
- Subquadratic zero-knowledgeJournal of the ACM, 1995
- Intersecting codes and independent familiesIEEE Transactions on Information Theory, 1994
- Sperner capacitiesGraphs and Combinatorics, 1993
- Covering arrays and intersecting codesJournal of Combinatorial Designs, 1993
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Two applications (for search theory and truth functions) of Sperner type theoremsPeriodica Mathematica Hungarica, 1973