Two Extensions of the Viterbi Algorithm

IEEE Transactions on Information Theory

Volumn 37, Issue 2, 1991, Pages 430-436

  Hart, G W ^b   Schwartz, M ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

data correction; Viterbi algorithm

Indexed keywords

AUTOMATA THEORY - FINITE AUTOMATA; SIGNAL PROCESSING - SIGNAL ENCODING; SYSTEMS SCIENCE AND CYBERNETICS - IDENTIFICATION;

CORRUPTED DATA SET; DATA CORRECTION; TRELLIS DIAGRAM; VITERBI ALGORITHM;

DATA PROCESSING;

EID: 0026117793     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.75270     Document Type: Article

References (10)

1. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms. New York: Addison Wesley, 1974.
2. D. P. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation, Numerical Methods. Englewood Cliffs, NJ: Prentice Hall, 1989.
3. D. P. Bertsekas, Dynamic Programming, Deterministic and Stochastic Models. Englewood Cliffs, NJ: Prentice Hall, 1987.
4. A. T. Bouloutas, “Modeling fault management in communication networks,” Ph.D. dissertation, Columbia Univ., New York, May 1990.
5. G. D. Forney, Jr., “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268–278, 1973.
6. K. S. Fu, Syntactic Pattern Recognition and Applications. Englewood Cliffs, NJ: Prentice Hall, 1982.
7. M. G. Thomason, “Errors in regular languages,” IEEE Trans. Comput., vol. C-23, no. 6, pp. 597–602, June 1974.
8. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260–269, 1967.
9. A. J. Viterbi, “Convolutional codes and their performance in communication systems,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 751–772, 1971.
10. R. A. Wagner and M. J. Fischer, “The string-to-string correction problem,” J. ACM, vol. 21, no. 1, pp. 168–173, Jan. 1974.