Shortened BCH codes (Corresp.)
Hermann J. Helgert, R. Stinaff · IEEE Transactions on Information Theory · 1973
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.