Abstract :
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.
