Coding Theory and Design Theory pp 9-15 | Cite as

# On the Length of Codes with a Given Covering Radius

Conference paper

## Abstract

We further develop techniques for showing the non-existence of short codes with a given covering radius. In particular we show that there does not exist a code of codimension 11 and covering radius 2 which has length 64. We conclude with a table which gives the best available information for the length of a code with codimension *m* and covering radius *r* for 2 ≤ *m* ≤ 24 and 2 ≤ *r* ≤ 24.

## Preview

Unable to display preview. Download preview PDF.

## References

- [1]D. Ashlock. private communication.Google Scholar
- [2]R.A. Brualdi, V.S. Pless and R.M. Wilson,
*Short codes with a given covering radius*, IEEE Trans. Inform. Theory (to appear).Google Scholar - [3]
- [4]G.D. Cohen, M.G. Karpovsky, H.F. Mattson, Jr., and J.R. Schatz,
*Covering radius*-*survey and recent results*, IEEE Trans. Inform. Theory, IT-31 (1985), pp. 328–343.MathSciNetCrossRefGoogle Scholar - [5]R.L. Graham and N.J.A. Sloane,
*On the covering radius of codes*, IEEE Trans. Inform. Theory, IT-31 (1985), pp. 385–401.MathSciNetCrossRefGoogle Scholar - [6]R. Kibler. private communicationGoogle Scholar
- [7]J. Simonis,
*The minimal covering radius**t*[15,6]*of a 6-dimensional binary linear code of length*15*is equal to*4, preprint.Google Scholar - [8]
- [9]

## Copyright information

© Springer-Verlag New York, Inc. 1990