The DOI matches its Crossref record.
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
Abstract
The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered. The decoding of linear block and convolutional codes to minimize symbol error probability is shown to be a special case of this problem. An optimal decoding algorithm is derived.
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
Cited by
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
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
Convergence behavior of iteratively decoded parallel concatenated codes
ten Brink, S. (2001) · IEEE Transactions on Communications · doi:10.1109/26.957394 · Cited by 2,386
Beyond Massive MIMO: The Potential of Data Transmission With Large Intelligent Surfaces
Hu, S., Rusek, F., & Edfors, O. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2816577 · Cited by 892
Anderson, J. B., Rusek, F., & Owall, V. (2013) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2233451 · Cited by 417
Metadata
- Authors
- Bahl, L., Cocke, J., Jelinek, F., & Raviv, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1974-03
- Volume
- 20
- Issue
- 2
- Pages
- 284-287
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2045407304
- Cited by
- 5,208
- References
- 0
- FWCI
- 4.57
- 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: Optimal decoding of linear codes for minimizing symbol error rate (Corresp.). https://app.cochat.ai/papers/10.1109/tit.1974.1055186
- The paper
- Bahl, L., Cocke, J., Jelinek, F., & Raviv, J. (1974). Optimal decoding of linear codes for minimizing symbol error rate (Corresp.). IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1974.1055186
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.
