Further results on the covering radius of codes
- 1 September 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 32 (5) , 680-694
- https://doi.org/10.1109/tit.1986.1057227
Abstract
A number of upper and lower bounds are obtained forK(n, R), the minimal number of codewords in any binary code of lengthnand covering radiusR. Several new constructions are used to derive the upper bounds, including an amalgamated direct sum construction for nonlinear codes. This construction works best when applied to normal codes, and we give some new and stronger conditions which imply that a linear code is normal. An upper bound is given for the density of a covering code over any alphabet, and it is shown thatK(n + 2, R + 1) \leq K(n, R)holds for sufficiently largen.Keywords
This publication has 24 references indexed in Scilit:
- On the covering radius of codesIEEE Transactions on Information Theory, 1985
- On the football pool problem for 6 matches: A new upper boundJournal of Combinatorial Theory, Series A, 1983
- Bounds for binary codes just outside the plotkin rangeInformation and Control, 1980
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- On covering sets and error-correcting codesJournal of Combinatorial Theory, Series A, 1971
- On Communication of Analog Data from a Bounded Source SpaceBell System Technical Journal, 1969
- A Combinatorial Problem in MatchingJournal of the London Mathematical Society, 1969
- Some discrete variable computationsProceedings of Symposia in Applied Mathematics, 1960
- Covering Problems Concerning Abelian GroupsJournal of the London Mathematical Society, 1952
- A Covering Theorem for Abelian GroupsJournal of the London Mathematical Society, 1951