The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
List Viterbi decoding algorithms with applications
Abstract
A list Viterbi decoding algorithm (LVA) produces a rank ordered list of the L globally best candidates after a trellis search. The authors present two such algorithms, (i) a parallel LVA that simultaneously produces the L best candidates and (ii) a serial LVA that iteratively produces the k/sup th/ best candidate based on knowledge of the previously found k-1 best paths. The application of LVA to a concatenated communication system consisting of an inner convolutional code and an outer error detecting code is considered in detail. Analysis as well as simulation results show that significant improvement in error performance is obtained when the inner decoder, which is conventionally based on the Viterbi algorithm (VA), is replaced by the LVA. An improvement of up to 3 dB is obtained for the additive white Gaussian noise (AWGN) channel due to an increase in the minimum Euclidean distance. Ever larger gains are obtained for the Rayleigh fading channel due to an increase in the time diversity. It is also shown that a 10% improvement in throughput is obtained along with significantly reduced probability of a decoding failure for a hybrid FEC/ARQ scheme with the inner code being a rate compatible punctured convolutional (RCPC) code.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Viterbi, A. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054010 · Cited by 6,759
Error control coding : fundamentals and applications
Lin, S., & Costello, D. J. (1983) · Medical Entomology and Zoology · Cited by 4,296
Channel coding with multilevel/phase signals
Ungerboeck, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056454 · Cited by 3,751
Principles of Communication Engineering
Jacobs, I. M., & Wozencraft, J. M. (1965) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,912
Rate-compatible punctured convolutional codes (RCPC codes) and their applications
Hagenauer, J. (1988) · IEEE Transactions on Communications · doi:10.1109/26.2763 · Cited by 1,827
Principles of digital communication and coding
Viterbi, A. J., & Omura, J. K. (1979) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,427
Anderson, J. B., Aulin, T., & Sundberg, C.-E. (1986) · Springer eBooks · doi:10.1007/978-1-4899-2031-7 · Cited by 1,137
Self-citationThe theory of error-correcting codes
Kung, J., & Rota, G.-C. (1979) · Advances in Mathematics · doi:10.1016/0001-8708(79)90034-3 · Cited by 550
Joint data and channel estimation using blind trellis search techniques
Seshadri, N. (1994) · IEEE Transactions on Communications · doi:10.1109/tcomm.1994.580208 · Cited by 257
Self-citation
Cited by
Optimized transmission of JPEG2000 streams over wireless channels
Thomos, N., Boulgouris, N. V., & Strintzis, M. G. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.860338 · Cited by 258
Metadata
- Authors
- Seshadri, N., & Sundberg, C.-E. W.
- Venue
- IEEE Transactions on Communications
- Published
- 1994-02
- Volume
- 42
- Issue
- 2/3/4
- Pages
- 313-323
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2149072083
- Cited by
- 371
- References
- 11
- FWCI
- 5.79
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: List Viterbi decoding algorithms with applications. https://app.cochat.ai/papers/10.1109/tcomm.1994.577040
- The paper
- Seshadri, N., & Sundberg, C.-E. W. (1994). List Viterbi decoding algorithms with applications. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.1994.577040
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
