The DOI matches its Crossref record.
Fast Sequential Decoding Algorithm Using a Stack
Abstract
In this paper a new sequential decoding algorithm is introduced that uses stack storage at the receiver. It is much simpler to describe and analyze than the Fano algorithm, and is about six times faster than the latter at transmission rates equal to Rcomp, the rate below which the average number of decoding steps is bounded by a constant. Practical problems connected with implementing the stack algorithm are discussed and a scheme is described that facilitates satisfactory performance even with limited stack storage capacity. Preliminary simulation results estimating the decoding effort and the needed stack size are presented.
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
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Off-line cursive script word recognition
Bozinovic, R. M., & Srihari, S. N. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.23114 · Cited by 455
The power of amnesia: Learning probabilistic automata with variable memory length
Ron, D., Singer, Y., & Tishby, N. (1997) · Machine Learning · doi:10.1007/bf00114008 · Cited by 447
Fast Algorithms for Signal Processing
Blahut, R. E. (2010) · doi:10.1017/cbo9780511760921 · Cited by 274
Metadata
- Authors
- Jelinek, F.
- Venue
- IBM Journal of Research and Development
- Publisher
- IBM
- Published
- 1969-11
- Volume
- 13
- Issue
- 6
- Pages
- 675-685
- ISSN
- 0018-8646 (ISSN-L)
- OpenAlex
- W2035227369
- Cited by
- 541
- References
- 0
- FWCI
- 10.50
- 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: Fast Sequential Decoding Algorithm Using a Stack. https://app.cochat.ai/papers/10.1147/rd.136.0675
- The paper
- Jelinek, F. (1969). Fast Sequential Decoding Algorithm Using a Stack. IBM Journal of Research and Development. https://doi.org/10.1147/rd.136.0675
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.
