Covering arrays and intersecting codes
- 1 January 1993
- journal article
- research article
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 1 (1) , 51-63
- https://doi.org/10.1002/jcd.3180010106
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Applications of coding theory to communication combinatorial problemsDiscrete Mathematics, 1990
- Intersecting Goppa codesIEEE Transactions on Information Theory, 1989
- An updated table of minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1987
- Linear binary codes with intersection propertiesDiscrete Applied Mathematics, 1984
- Modular curves and codes with a polynomial constructionIEEE Transactions on Information Theory, 1984
- Families of finite sets in which no set is covered by the union of two othersJournal of Combinatorial Theory, Series A, 1982
- A new approach to error-correcting codesIEEE Transactions on Information Theory, 1977
- Two applications (for search theory and truth functions) of Sperner type theoremsPeriodica Mathematica Hungarica, 1973
- BiplanesMathematische Zeitschrift, 1973
- Ein Satz ber Untermengen einer endlichen MengeMathematische Zeitschrift, 1928