IEEE Transactions on Information Theory · 1983 · 95 citations · 6 references
EngineeringComputer ScienceMathematicsCombinatoricsInformation TheoryTheory Of ComputationChannel CodingCoding TheoryError Control CodingError-correcting CodesBch CodesBose-chaudhuri-hocquenghem CodesBounds On CodesCode BoundsCyclic CodesLower Bound TechniquesMinimum DistanceMinimum Distance Bounds
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.
6
J. J. Stiffler · 1971 · 1.4K citations
On a class of error correcting binary group codes
R. C. Bose, D.K. Ray-Chaudhuri · Information and Control · 1960 · 1.3K citations
Generalizations of the BCH bound
C. Hartmann, K.K. Tzeng · Information and Control · 1972 · 153 citations
Further results on error correcting binary group codes
R. C. Bose, D.K. Ray-Chaudhuri · Information and Control · 1960 · 145 citations