Maximum likelihood erasure decoding scheme for concatenated codes
Youzhi Xu · IEE Proceedings I Communications Speech and Vision · 1992
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(2k) 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.