Improved sphere bounds on the covering radius of codes
- 1 March 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (2) , 237-245
- https://doi.org/10.1109/18.2632
Abstract
The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of length n and with covering radius R. By simple arguments it is considerably improved, to K(n,1)⩾2 n/n for n even. A table of lower and upper bounds on K(n,R) for n⩽33, R ⩽10 is includedKeywords
This publication has 20 references indexed in Scilit:
- Further results on the covering radius of codesIEEE Transactions on Information Theory, 1986
- The football pool problem for 7 and 8 matchesJournal of Combinatorial Theory, Series A, 1983
- Introduction to Coding TheoryPublished by Springer Nature ,1982
- On a Covering Problem Concerning Abelian GroupsJournal of the London Mathematical Society, 1971
- Note on a theorem of ZarembaJournal of Combinatorial Theory, 1969
- A Combinatorial Problem in MatchingJournal of the London Mathematical Society, 1969
- The football pool problem for 5 matchesJournal of Combinatorial Theory, 1967
- Covering Problems Concerning Abelian GroupsJournal of the London Mathematical Society, 1952
- A Covering Theorem for Abelian GroupsJournal of the London Mathematical Society, 1951
- COVERING THEOREMS FOR GROUPSThe Quarterly Journal of Mathematics, 1950