Title :
Maximum-likelihood decoding of Reed-Solomon codes
Author :
Vuckovic, Jelena S. ; Vucetic, Branka S.
Author_Institution :
Dept. of Electr. Eng., Sydney Univ., NSW, Australia
fDate :
29 Jun-4 Jul 1997
Abstract :
We propose a maximum likelihood algorithm for Reed-Solomon codes of reasonable complexity. All possible error patterns are organised into decoding levels, each level corresponding to some range of distances from the received sequence. Levels are tested subsequently, until the first code word is found
Keywords :
Gaussian channels; Reed-Solomon codes; coding errors; computational complexity; error statistics; maximum likelihood decoding; phase shift keying; AWGN channel; BER; BPSK modulation; Reed-Solomon codes; code complexity; code word; decoding levels; distances; maximum likelihood algorithm; maximum-likelihood decoding; received sequence; AWGN channels; Binary phase shift keying; Binary trees; Bit error rate; Maximum likelihood decoding; Maximum likelihood estimation; Modulation coding; Reed-Solomon codes; Sorting; Testing;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613337
