Modified bounds for covering codes
- 1 March 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (2), 351-365
- https://doi.org/10.1109/18.75253
Abstract
No abstract availableThis publication has 31 references indexed in Scilit:
- Upper bounds for football pool problems and mixed covering codesJournal of Combinatorial Theory, Series A, 1991
- Applications of coding theory to communication combinatorial problemsDiscrete Mathematics, 1990
- Inequalities for covering codesIEEE Transactions on Information Theory, 1988
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985
- Bounds for binary codes of length less than 25IEEE Transactions on Information Theory, 1978
- On the covering of pairs by quadruples IJournal of Combinatorial Theory, Series A, 1972
- Maximal and minimal coverings of (k− 1)-tuples byk-tuplesPacific Journal of Mathematics, 1968
- Covering problems for dichotomized matchingsAequationes mathematicae, 1968
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1967
- Minimal coverings of pairs by triplesPacific Journal of Mathematics, 1958