Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
- 1 November 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 32 (6) , 826-828
- https://doi.org/10.1109/tit.1986.1057249
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Good coverings of Hamming spaces with spheresDiscrete Mathematics, 1985
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985
- A new approach to the general minimum distance decoding problem: The zero-neighbors algorithmIEEE Transactions on Information Theory, 1985
- On the covering radius of codesIEEE Transactions on Information Theory, 1985
- A nonconstructive upper bound on covering radiusIEEE Transactions on Information Theory, 1983