Decoding concatenated codes using soft information

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2002, Pages 148-157

  Guruswami, Venkatesan ^a   Sudan, Madhu ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036292563     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
2. Concatenated codes and their multilevel generalizations
3. Generalized minimum distance decoding
4. Combinatorial bounds for list decoding
5. Improved decoding of Reed-Solomon and algebraic-geometric codes
6. List decoding algorithms for certain concatenated codes
7. On representations of algebraic-geometric codes
8. On the complexity of approximating the VC dimension
9. Simple extractors for all min-entropies and a new pseudo-random generator
10. A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
11. List decoding of algebraic-geometric codes
12. Expander codes
13. Decoding of Reed-Solomon codes beyond the error-correction bound
14. List decoding: Algorithms and applications
15. Pseudorandom generators without the XOR lemma
16. Extractor codes
17. Pseudo-random generators for all hardnesses
18. Introduction to coding theory
19. Justesen's construction the low-rate case