DocumentCode
3275652
Title
A class of linear-complexity, soft-decodable, high-rate, “good” codes: construction, properties and performance
Author
Li, Jing ; Narayanan, Krishna R. ; Georghiades, Costas N.
Author_Institution
Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA
fYear
2001
fDate
2001
Firstpage
122
Abstract
A new class of high-rate, low-complexity and soft-decodable codes, named product accumulate codes, is proposed. The code structure, properties, thresholds and performance are investigated and it is shown that these codes are capable of near-capacity performance
Keywords
computational complexity; concatenated codes; interleaved codes; iterative decoding; linear codes; turbo codes; Shannon limit; code construction; code performance; code properties; code structure; high-rate codes; interleaved code concatenation; iterative decoding; linear code; linear-complexity; low-complexity codes; near-capacity performance; product accumulate codes; recursive inner code; simulation results; single-parity check turbo product codes; soft-decodable codes; Bit error rate; Computational modeling; Error analysis; Error correction codes; Interleaved codes; Iterative algorithms; Iterative decoding; Iterative methods; Parity check codes; Product codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location
Washington, DC
Print_ISBN
0-7803-7123-2
Type
conf
DOI
10.1109/ISIT.2001.935985
Filename
935985
Link To Document