A new lower bound for the minimum distance of a cyclic code
- 1 May 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 29 (3), 330-332
- https://doi.org/10.1109/tit.1983.1056672
Abstract
A new lower bound for the minimum distance of a linear code is derived. When applied to cyclic codes both the Bose-Chaudhuri-Hocquenghem (BCH) bound and the Hartmann-Tzeng (HT) bound are obtained as corollaries. Examples for which the new bound is superior to these two bounds, as well as to the Carlitz-Uchiyama bound, are given.Keywords
This publication has 6 references indexed in Scilit:
- On the Preparata and Goethals codesIEEE Transactions on Information Theory, 1983
- A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng boundJournal of Combinatorial Theory, Series A, 1982
- Introduction to Coding TheoryPublished by Springer Nature ,1982
- Generalizations of the BCH boundInformation and Control, 1972
- Further results on error correcting binary group codesInformation and Control, 1960
- On a class of error correcting binary group codesInformation and Control, 1960