Convolutional codes II. Maximum-likelihood decoding

Information and Control

Volumn 25, Issue 3, 1974, Pages 222-266

  David Forney Jr , G ^a  

^a MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0015943124     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(74)90870-5     Document Type: Article

References (33)

1. Error probability bounds for systematic convolutional codes
2. The finite Fourier transform
3. Free distance bounds for convolutional codes
4. Error bounds for parallel communication channels
5. Coding for two noisy channels
6. comp
7. Convolutional codes III Sequential decoding
8. The Viterbi algorithm
9. Convolutional codes I Algebraic structure
10. Exponential error bounds for erasure list and decision feedback schemes
11. Review of Random Tree Codes
12. The random coding bound is tight for the average code
13. A simple derivation of the coding theorem and some applications
14. A serial orthogonal decoder, Jet Propulsion Lab.
15. A serial orthogonal decoder, Jet Propulsion Lab.
16. An upper bound on moments of sequential decoding effort
17. A class of constructive asymptotically good algebraic codes
18. An Upper Bound on the Free Distance of a Tree Code
19. Upper bounds for the number of vectors in binary errorcorrecting codes and for the number of non-overlapping spherical segments on the Euclidean sphere (an improvement of Elias' and Chabauty-Rankin's bounds)
20. An implementable class of pairwise independent convolutional codes
21. Solutions of the Shortest-Route Problem—A Review
22. A note on very noisy channels
23. Sequential decoding—The computation problem
24. Lower bounds to error probability for coding on discrete memoryless channels
25. Convolutional codes and their performance in communication systems
26. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
27. Further results on optimal decoding of convolutional codes
28. Channel state testing in information decoding
29. On estimation of the complexity of construction of binary linear concatenated codes