Title :
A note off two binary signaling alphabets
fDate :
6/1/1956 12:00:00 AM
Abstract :
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.
Keywords :
Error-correcting codes; Maximum-likelihood detection; Reed-Muller codes; Binary sequences; Books; Detectors; Error correction; Error correction codes; Information theory; Maximum likelihood detection; Parity check codes; Redundancy; Symmetric matrices; Writing;
Journal_Title :
Information Theory, IRE Transactions on
DOI :
10.1109/TIT.1956.1056790
