An improved method to compute lists of binary vectors that optimize a given weight function with application to soft-decision decoding

IEEE Communications Letters

Volumn 5, Issue 11, 2001, Pages 456-458

  Valembois, Antoine ^b   Fossorier, Marc ^a,b  

^a IEEE

^b University of Hawaii at Manoa   (United States)

Author keywords

Codes; Decoding; Maximum likelihood decoding; Search methods; Tree searching

Indexed keywords

ALGORITHMS; CODING ERRORS; DECODING; ERROR CORRECTION; HEURISTIC METHODS; MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION; TREES (MATHEMATICS);

BINARY VECTORS;

BINARY CODES;

EID: 0035507562     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/4234.966032     Document Type: Article

References (9)

1. Décodage pondéré optimal des codes linéaires en blocs
2. A decoding algorithm for binary block codes and J-ary output channels
3. Suboptimal decoding of linear codes: Partition technique
4. Soft-decision decoding using punctured codes
5. Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes
6. Soft-decision decoding of linear block codes based on ordered statistics
7. Reliability-based code-search algorithms for maximum-likelihood decoding of block codes
8. An efficient call-by-need algorithm for the maximum likelihood decoding of a linear code
9. An efficient maximum-likelihood-decoding of linear block codes with algebraic decoder