An upper bound on the covering radius as a function of the dual distance
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (6) , 1472-1474
- https://doi.org/10.1109/18.59949
Abstract
P. Delsarte (1973) developed a method that gives an upper bound on the cardinality of a code as a function of its minimum distance. It is shown that, using a modification of that method, one gets an upper bound on the covering radius of a code as a function of its dual distance. As an interesting special case, the covering radius of the dual of a BCH code is consideredKeywords
This publication has 8 references indexed in Scilit:
- Covering radius and dual distanceDesigns, Codes and Cryptography, 1991
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985
- The covering radius of cyclic codes of length up to 31 (Corresp.)IEEE Transactions on Information Theory, 1985
- Introduction to Coding TheoryPublished by Springer Nature ,1982
- On the covering radius of binary codes (Corresp.)IEEE Transactions on Information Theory, 1978
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- A New Class of Cyclic CodesSIAM Journal on Applied Mathematics, 1968
- Bounds for exponential sumsDuke Mathematical Journal, 1957