On combining Chase-2 and GMD decoding algorithms for nonbinary block codes

IEEE Communications Letters

Volumn 5, Issue 5, 2001, Pages 209-211

  Tang, Heng ^a,b   Liu, Ye ^a,c   Fossorier, Marc ^a,d   Lin, Shu ^a,b  

^a IEEE   (United States)

^b University of California   (United States)

^c AGERE SYSTEMS   (United States)

^d University of Hawaii at Manoa   (United States)

Author keywords

Nonbinary block codes; Soft decision decoding

Indexed keywords

LOG-LIKELIHOOD-RATIO (LLR); SOFT DECISION DECODING;

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DECODING; GAUSSIAN NOISE (ELECTRONIC); WHITE NOISE;

BLOCK CODES;

EID: 0035334348     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/4234.922762     Document Type: Article

References (10)

1. Generalized minimum distance decoding
2. A class of algorithms for decoding block codes with channel measurement information
3. A note on soft decision decoding with successive erasures
4. An improvement to generalized-minimum-distance decoding
5. Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
6. Chase-type and GMD coset decodings
7. Generalized minimum-distance decoding of Euclidean-space codes and lattices
8. A sufficient condition for ruling out some useless test error patterns in iterative decoding algorithms
9. An interactive concatenated turbo coding system