Covering radius and dual distance
- 1 May 1991
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 1 (1) , 31-46
- https://doi.org/10.1007/bf00123957
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An optimal polynomial for a covering radius problemDiscrete Mathematics, 1992
- Generalization of the Norse bounds to codes of higher strengthIEEE Transactions on Information Theory, 1991
- Asymptotic bounds on the covering radius of binary codesIEEE Transactions on Information Theory, 1990
- On the coveting radius of extremal self-dual codesIEEE Transactions on Information Theory, 1983
- Introduction to Coding TheoryPublished by Springer Nature ,1982
- Linear programming bounds for tree codes (Corresp.)IEEE Transactions on Information Theory, 1979
- 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
- An upper bound for self-dual codesInformation and Control, 1973
- Weight congruences for p-ary cyclic codesDiscrete Mathematics, 1972