Title :
Decoding of second order Reed-Muller codes with a large number of errors
Author_Institution :
Ecole Nationale Superieure de Techniques Avancees, Paris, France
fDate :
29 Aug.-1 Sept. 2005
Abstract :
Second order Reed-Muller codes are considered over a binary symmetric channel. We present a modified version of V.M Sidel´nikov and A.S. Pershakov algorithm, Problemy Peredachi Informatsii 1992, that has complexity of order n2log(n). Experimental results show that the algorithm corrects most error patterns of weight up to n/2(1-e) given that e exceeds n-1/3. This outperforms other decoding algorithms known for RM codes. Decoding performance for known algorithms has been evaluated and the results correspond to asymptotic performance for these algorithms.
Keywords :
Reed-Muller codes; computational complexity; error correction codes; maximum likelihood decoding; RM codes; asymptotic performance; binary symmetric channel; decoding algorithms; error correction codes; second order Reed-Muller codes; Algorithm design and analysis; Character generation; Communication channels; Encoding; Error correction; Error correction codes; Euclidean distance; Hamming distance; Linearity; Maximum likelihood decoding;
Conference_Titel :
Information Theory Workshop, 2005 IEEE
Print_ISBN :
0-7803-9480-1
DOI :
10.1109/ITW.2005.1531882
