Some new lower bounds for binary and ternary covering codes
- 1 July 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (4) , 1422-1424
- https://doi.org/10.1109/18.243462
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Genetic algorithms in coding theory — a table for A3(n,d)Discrete Applied Mathematics, 1993
- Generalized bounds on binary/ternary mixed packing and covering codesJournal of Combinatorial Theory, Series A, 1991
- Upper bounds for q-ary covering codesIEEE Transactions on Information Theory, 1991
- Lower bounds for q-ary covering codesIEEE Transactions on Information Theory, 1990
- New upper bounds for the football pool problem for 6, 7, and 8 matchesJournal of Combinatorial Theory, Series A, 1989
- On normal and subnormal q-ary codesIEEE Transactions on Information Theory, 1989
- Lower bounds for binary covering codesIEEE Transactions on Information Theory, 1988
- Further results on the covering radius of codesIEEE Transactions on Information Theory, 1986
- On the football pool problem for 6 matches: A new upper boundJournal of Combinatorial Theory, Series A, 1983
- Covering problems for dichotomized matchingsAequationes mathematicae, 1968