Abstract:
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 giv...Show MoreMetadata
Abstract:
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.
Published in: IEEE Transactions on Information Theory ( Volume: 19, Issue: 6, November 1973)