On the covering radius of cyclic linear codes and arithmetic codes
- 1 June 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 11 (2) , 157-173
- https://doi.org/10.1016/s0166-218x(85)80006-8
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- All binary 3-error-correcting BCH codes of length2^m-ihave covering radius 5 (Corresp.)IEEE Transactions on Information Theory, 1978
- The weight distribution of irreducible cyclic codes with block lengths n1((q1−1)N)Discrete Mathematics, 1977
- A note on Waring's problem in GF (p)Acta Arithmetica, 1976
- Weak radix representation and cyclic codes over euclidean domainsCommunications in Algebra, 1976
- On modular weight and cyclic nonadjacent forms for arithmetic codes (Corresp.)IEEE Transactions on Information Theory, 1974
- Four fundamental parameters of a code and their combinatorial significanceInformation and Control, 1973
- Weights of irreducible cyclic codesInformation and Control, 1972
- Two-error correcting Bose-Chaudhuri codes are quasi-perfectInformation and Control, 1960
- Bounds for exponential sumsDuke Mathematical Journal, 1957