Dynamic programming and the graphical representation of error-correcting codes

IEEE Transactions on Information Theory

Volumn 47, Issue 2, 2001, Pages 549-568

  Geman, S ^a   Kochanek, K ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Dynamic programming; Graphical models; Maximum likelihood decoding; Soft decoding

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; DYNAMIC PROGRAMMING; ERROR CORRECTION; GRAPHIC METHODS; MARKOV PROCESSES; MAXIMUM LIKELIHOOD ESTIMATION;

MAXIMUM LIKELIHOOD DECODING;

CODES (SYMBOLS);

EID: 0035246544     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.910574     Document Type: Article

References (39)

1. A maximum likelihood approach to continuous speech recognition
2. Probability functions on complex pedigrees
3. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
4. Codes and iterative decoding on general graphs
5. On iterative decoding and the two-way algorithm
6. Bucket elimination: A unifying framework for probabilistic inference
7. A recursive approach to low complexity codes
8. Optimal decoding of linear codes for minimizing symbol error rate
9. Near Shannon limit error-correcting coding and decoding: Turbo-codes
10. Good error-correcting codes based on very sparse matrices
11. Iterative decoding of compound codes by probability propagation in graphical models
12. Models for channels with memory and their applications to error control
13. Coset codes - Part II: Binary lattices and related codes
14. Coarse-to-fine dynamic programming
15. A tutorial on hidden Markov models and selected applications in speech recognition
16. Graphical templates for model registration
17. Graphical Models for Machine Learning and Digital Communication
18. Hidden Markov random fields
19. Complexity of finding embeddings in a k-tree
20. The Viterbi algorithm
21. Fractal estimation using models on multiscale trees
22. Further results on product codes
23. Document image decoding by heuristic search