Title :
Maximum likelihood erasure decoding scheme for concatenated codes
Author_Institution :
Dept. of Electr. Eng., Linkoping Univ., Sweden
fDate :
6/1/1992 12:00:00 AM
Abstract :
A maximum likelihood erasure decoding scheme for concatenated codes, in which the outer code is an (N,K,D) Reed-Solomon (RS) code and the inner code is an (n,k,d) linear code, is described. The complexity of the decoding is O((n-k) 3) additions in GF(2) for the linear inner code and O((D-1) 2) multiplications in GF(2 k) for the RS outer code. An algorithm for solving the Vandermonde system of equations is applied in the outer decoding algorithm, which has less complexity than the Forney algorithm.<>
Keywords :
decoding; error correction codes; (n,k,d) linear code; Reed Solomon codes; Vandermonde equations; concatenated codes; decoding algorithm; decoding complexity; error correction codes; inner code; maximum likelihood erasure decoding; outer code;
Journal_Title :
Communications, Speech and Vision, IEE Proceedings I
