Some results on the minimum distance structure of cyclic codes
- 1 May 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 18 (3) , 402-409
- https://doi.org/10.1109/tit.1972.1054816
Abstract
This paper presents a number of interesting results relating to the determination of actual minimum distance of cyclic codes. Codes with multiple sets of consecutive roots are constructed. A bound on the minimum weight of odd-weight codewords is determined. Relations on the distribution of roots of the generator polynomial are investigated. Location polynomials of reversible codes are examined. These results are used to obtain better estimates of the minimum distance of many new cyclic codes.Keywords
This publication has 13 references indexed in Scilit:
- On the minimum distance of certain reversible cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1970
- Comments on "The weight structure of some Bose-Chaudhuri codes" by Goldman, H. D., Kilman, M., and Smola, H.IEEE Transactions on Information Theory, 1969
- Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH CodesIEEE Transactions on Information Theory, 1969
- Factorization of cyclic codesIEEE Transactions on Information Theory, 1967
- Analysis of weight distribution in binary cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1966
- A Theorem on the Distribution of Weights in a Systematic Code†Bell System Technical Journal, 1963
- A New Treatment of Bose-Chaudhuri CodesJournal of the Society for Industrial and Applied Mathematics, 1961
- A Class of Error-Correcting Codes in $p^m $ SymbolsJournal of the Society for Industrial and Applied Mathematics, 1961
- Further results on error correcting binary group codesInformation and Control, 1960
- On a class of error correcting binary group codesInformation and Control, 1960