Shortened BCH codes (Corresp.)
- 1 November 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 19 (6) , 818-820
- https://doi.org/10.1109/tit.1973.1055099
Abstract
By shortening certain binary primitive BCH codes, we derive a number of linear error-correcting codes with minimum distances superior to any known previously. We also give the weight spectra of three nonprimitive BCH codes whose minimum distances likewise constitute a significant improvement over those of the best codes previously known.Keywords
This publication has 7 references indexed in Scilit:
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- A survey of constructive coding theory, and a table of binary codes of highest known rateDiscrete Mathematics, 1972
- On the Golay perfect binary codeJournal of Combinatorial Theory, Series A, 1971
- Computer results on the minimum distance of some binary cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1970
- Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH CodesIEEE Transactions on Information Theory, 1969
- A New Class of Cyclic CodesSIAM Journal on Applied Mathematics, 1968
- The weight structure of some Bose-Chaudhuri codes (Corresp.)IEEE Transactions on Information Theory, 1968