Viterbi Decoding is an algorithmic method in error correction that belongs to the class of maximum likelihood sequence estimation techniques, distinguished by its use of dynamic programming to efficiently compute the most probable sequence of transmitted symbols through a convolutional code by tracing the optimal path in a trellis diagram.
1.6K
Publications
108.6K
Citations
3.4K
Authors
932
Institutions
Publications per year
2017–2026
148
Variants
Viterbi Algorithm
Publications
1.6K
G. David Forney · Proceedings of the IEEE · 1973 · 5.7K citations
A Systematic Comparison of Various Statistical Alignment Models
Franz Josef Och, Hermann Ney · Computational Linguistics · 2003 · 3.9K citations · Full text
1–5 of 1.6K
Authors
3.4K
- HM
14
h-index
- HT
14
h-index
- GF
13
h-index
- PH
13
h-index
- JH
13
h-index
1–5 of 3.4K
Institutions
932
AT&T (United States)
Bedminster, United States
24 h-index
42 publications
4.6K citations
Stanford University
Stanford, United States
20 h-index
25 publications
4.1K citations
University of California, Berkeley
Berkeley, United States
19 h-index
25 publications
1.2K citations
University of Toronto
Toronto, Canada
19 h-index
27 publications
8K citations
RWTH Aachen University
Aachen, Germany
19 h-index
25 publications
6K citations
IBM (United States)
Armonk, United States
18 h-index
24 publications
1.3K citations
University of Southern California
Los Angeles, United States
17 h-index
23 publications
3.6K citations
University of California, Los Angeles
Los Angeles, United States
17 h-index
27 publications
941 citations
1–8 of 932
Venues
- IEEE Transactions on Communications
153 publications · 11.3K citations
50
h-index
- IEEE Transactions on Information Theory
82 publications · 23K citations
39
h-index
- IEEE Journal on Selected Areas in Communications
33 publications · 2.4K citations
23
h-index
- IRE Transactions on Communications Systems
34 publications · 3K citations
21
h-index
- IEEE Transactions on Magnetics
37 publications · 1.2K citations
20
h-index
1–5