A generalization of Hamming's single error correcting codes is given along with a simple maximum likelihood detection scheme. For small redundancy these alphabets are unexcelled. The Reed-Muller alphabets are described as parity check alphabets and a new detection scheme is presented for them.
Read full abstract