DocumentCode
936674
Title
Maximum likelihood erasure decoding scheme for concatenated codes
Author
Xu, Youzhi
Author_Institution
Dept. of Electr. Eng., Linkoping Univ., Sweden
Volume
139
Issue
3
fYear
1992
fDate
6/1/1992 12:00:00 AM
Firstpage
336
Lastpage
339
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;
fLanguage
English
Journal_Title
Communications, Speech and Vision, IEE Proceedings I
Publisher
iet
ISSN
0956-3776
Type
jour
Filename
145208
Link To Document