Title :
A new lower bound for the minimum distance of a cyclic code
fDate :
5/1/1983 12:00:00 AM
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 :
Cyclic coding; Galois fields; Information theory; Linear code; Mathematics; Parity check codes; Retirement;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1983.1056672
