Skip to Main Content
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.
Date of Publication: May 1983