Asymptotic bounds on the covering radius of binary codes
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (6) , 1470-1472
- https://doi.org/10.1109/18.59948
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Explicit codes with low covering radiusIEEE Transactions on Information Theory, 1988
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)IEEE Transactions on Information Theory, 1986
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985
- On the covering radius of codesIEEE Transactions on Information Theory, 1985
- On the covering radius of binary codes (Corresp.)IEEE Transactions on Information Theory, 1978
- Four fundamental parameters of a code and their combinatorial significanceInformation and Control, 1973