Title :
Near-optimum decoding for subcodes of Reed-Muller codes
Author :
Dumer, Ilya ; Shabunov, Kirill
Author_Institution :
California Univ., Riverside, CA, USA
Abstract :
Using recursive techniques, we obtain near-optimum decoding with feasible complexity for RM codes of lengths up to 512 and their subcodes
Keywords :
Reed-Muller codes; maximum likelihood decoding; RM codes; Reed-Muller codes; complexity; maximum likelihood decoding; near-optimum decoding; recursive techniques; subcodes; AWGN channels; Additive white noise; Bit error rate; Cost function; Gaussian noise; Maximum likelihood decoding; Memoryless systems; Protection;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.936192
