Generalization of the Norse bounds to codes of higher strength
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (1) , 190-192
- https://doi.org/10.1109/18.61138
Abstract
The Norse bounds state that all codes of strength 1 and length n have covering radius at most n/2 and all self-complementary codes of strength 2 and length n have covering radius at most (n-√n)/2. This is generalized to arbitrary even values of strength, still assuming self-complementarity, and to odd strengths without this hypothesis. The proof techniques used are probabilisticKeywords
This publication has 5 references indexed in Scilit:
- Some new upper bounds on the covering radius of binary linear codesIEEE Transactions on Information Theory, 1989
- 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
- On the covering radius of binary codes (Corresp.)IEEE Transactions on Information Theory, 1978
- The weight-distribution of a coset of a linear code (Corresp.)IEEE Transactions on Information Theory, 1978