Codes over Integer Residue Rings

Linear codes over the ring of integers modulo q = pr, p a prime, are considered. Natural analogs to Hamming, Reed—Solomon, and BCH codes over finite fields are defined and their properties investigated. Some ring theoretic problems encountered are discussed.