A class of linear-complexity, soft-decodable, high-rate, "good" codes: Construction, properties and performance

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2001, Pages 122-

  Li, J ^a   Narayanan, K R ^a   Georghiades, C N ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE DECODING; PRODUCT ACCUMULATE CODES; SINGLE PARITY CHECK CODES; SOFT DECODING; TURBO PRODUCT CODES;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; ENCODING (SYMBOLS); ITERATIVE METHODS; MAXIMUM LIKELIHOOD ESTIMATION;

TURBO CODES;

EID: 0034857027     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Good error-correcting codes based on very sparse matrices
2. Product accumulate codes: A class of capacity-approaching, low-complexity codes
3. Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding
4. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation