The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Convolutional Codes and Their Performance in Communication Systems
Abstract
This tutorial paper begins with an elementary presentation of the fundamental properties and structure of convolutional codes and proceeds with the development of the maximum likelihood decoder. The powerful tool of generating function analysis is demonstrated to yield for arbitrary codes both the distance properties and upper bounds on the bit error probability for communication over any memoryless channel. Previous results on code ensemble average error probabilities are also derived and extended by these techniques. Finally, practical considerations concerning finite decoding memory, metric representation, and synchronization are discussed.
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
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
Self-citationInformation Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Principles of Communication Engineering
Jacobs, I. M., & Wozencraft, J. M. (1965) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,912
Principles of data communication
Lucky, R. W., Weldon, E. J., & Salz, J. (1968) · CERN Document Server (European Organization for Nuclear Research) · Cited by 754
A simple derivation of the coding theorem and some applications
Gallager, R. (1965) · IEEE Transactions on Information Theory · doi:10.1109/tit.1965.1053730 · Cited by 687
Fast Sequential Decoding Algorithm Using a Stack
Jelinek, F. (1969) · IBM Journal of Research and Development · doi:10.1147/rd.136.0675 · Cited by 541
A heuristic discussion of probabilistic decoding
Fano, R. (1963) · IEEE Transactions on Information Theory · doi:10.1109/tit.1963.1057827 · Cited by 494
Lower bounds to error probability for coding on discrete memoryless channels. II
Shannon, C. E., Gallager, R. G., & Berlekamp, E. R. (1967) · Information and Control · doi:10.1016/s0019-9958(67)91200-4 · Cited by 384
Sequential decoding for reliable communication
Wozencraft, J. M. (1957) · Cited by 141
Cited by
Near optimum error correcting coding and decoding: turbo-codes
Berrou, C., & Glavieux, A. (1996) · IEEE Transactions on Communications · doi:10.1109/26.539767 · Cited by 2,761
Forney, G. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054829 · Cited by 2,461
Adaptive Maximum-Likelihood Receiver for Carrier-Modulated Data-Transmission Systems
Ungerboeck, G. (1974) · IEEE Transactions on Communications · doi:10.1109/tcom.1974.1092267 · Cited by 653
The Art of Error Correcting Coding
Morelos‐Zaragoza, R. H. (2002) · Wiley eBooks · doi:10.1002/0470847824 · Cited by 376
Tracking a maneuvering target using input estimation versus the interacting multiple model algorithm
Bar-Shalom, Y., Chang, K. C., & Blom, H. A. P. (1989) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.18693 · Cited by 327
Metadata
- Authors
- Viterbi, A.
- Venue
- IEEE Transactions on Communication Technology
- Published
- 1971-10
- Volume
- 19
- Issue
- 5
- Pages
- 751-772
- ISSN
- 0018-9332 (ISSN-L)
- OpenAlex
- W2122683098
- Cited by
- 1,012
- References
- 9
- FWCI
- 23.21
- 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: Convolutional Codes and Their Performance in Communication Systems. https://app.cochat.ai/papers/10.1109/tcom.1971.1090700
- The paper
- Viterbi, A. (1971). Convolutional Codes and Their Performance in Communication Systems. IEEE Transactions on Communication Technology. https://doi.org/10.1109/tcom.1971.1090700
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.