On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
- 1 October 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 8 (4) , 619-627
- https://doi.org/10.1137/0608050
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Further results on the covering radius of codesIEEE Transactions on Information Theory, 1986
- A new approach to the covering radius of codesJournal of Combinatorial Theory, Series A, 1986
- An improved upper bound on covering radiusPublished by Springer Nature ,1986
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985
- On the covering radius of codesIEEE Transactions on Information Theory, 1985
- Computing automorphism groups of error-correcting codesIEEE Transactions on Information Theory, 1982
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- Some Further Theory of Group CodesBell System Technical Journal, 1960