IEEE Transactions on Information Theory · 1975 · 273 citations · 6 references
EngineeringComputer ScienceMathematicsAlgorithmsChannel CodingCoding TheoryError Control CodingError-correcting CodesBch CodesCodes Over Finite FieldsDecoding AlgorithmsGoppa CodesMinimum DistanceMinimum Distance BoundsReed-solomon CodesReed-solomon Coding
A simple approach to recent generalizations of BCH and Goppa codes, viewed as subfield subcodes of modified Reed-Solomon codes, is presented. The orthogonal complements of these codes are characterized, and generalized versions of some previous results about minimum distance and decoding are obtained.
6
Elwyn R. Berlekamp · IEEE Transactions on Information Theory · 1973 · 123 citations
Noncyclic generalizations of BCH and srivastava codes
Hermann J. Helgert · Information and Control · 1972 · 14 citations