DocumentCode
1891381
Title
Reduced GMD decoding of concatenated codes
Author
Weber, Jos H. ; Abdel-Ghaffar, Khaled A S
Author_Institution
Dept. ITS, Delft Univ. of Technol., Netherlands
Volume
2
fYear
2001
fDate
2001
Firstpage
901
Abstract
We present a general version of the generalized minimum distance (GMD) decoding algorithm (see Forney, G.D., Jr, 1966) that accommodates different erasing strategies. This version is called reduced GMD decoding since, depending on the erasing strategy used, it can offer a reduction in complexity over Forney´s GMD decoding. We apply reduced GMD decoding to concatenated codes. In particular, we study the error correction capability and the unsuccessful decoding probability of concatenated codes with reduced GMD decoding
Keywords
computational complexity; concatenated codes; decoding; error correction; probability; complexity; concatenated codes; erasing strategies; error correction; generalized minimum distance decoding; unsuccessful decoding probability; Chromium; Concatenated codes; Decoding; Detectors; Error correction; Error correction codes; Forward error correction; Hamming distance;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE
Conference_Location
San Antonio, TX
Print_ISBN
0-7803-7206-9
Type
conf
DOI
10.1109/GLOCOM.2001.965549
Filename
965549
Link To Document