Sequential Decoding is a probabilistic decoding algorithm for convolutional codes that belongs to the class of tree-search methods, distinguished by its use of a dynamically explored path metric to sequentially traverse the code tree and identify the most likely transmitted sequence under a constrained computational effort.
259
Publications
19.7K
Citations
510
Authors
232
Institutions
Publications per year
2017–2026
48
Parents
Publications
259
1–5 of 259
Authors
510
- DJ
11
h-index
- DH
7
h-index
- JH
6
h-index
- SK
5
h-index
- MF
5
h-index
1–5 of 510
Institutions
232
University of Notre Dame
Notre Dame, United States
12 h-index
19 publications
697 citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
16 publications
1.5K citations
Illinois Institute of Technology
Chicago, United States
7 h-index
11 publications
465 citations
MIT Lincoln Laboratory
Lexington, United States
7 h-index
11 publications
179 citations
Polytechnique Montréal
Montreal, Canada
7 h-index
14 publications
1.1K citations
University of British Columbia
Vancouver, Canada
5 h-index
7 publications
123 citations
Peter the Great St. Petersburg Polytechnic University
Saint Petersburg, Russia
5 h-index
7 publications
308 citations
Tel Aviv University
Tel Aviv, Israel
5 h-index
11 publications
373 citations
1–8 of 232
Venues
- IEEE Transactions on Information Theory
52 publications · 11.9K citations
28
h-index
- IEEE Transactions on Communications
35 publications · 1.5K citations
21
h-index
- IEEE Communications Letters
8 publications · 248 citations
8
h-index
- IRE Transactions on Communications Systems
7 publications · 130 citations
7
h-index
- IEEE Transactions on Communication Technology
6 publications · 594 citations
6
h-index
1–5