The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
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
Cites
Principles of Communication Engineering
Jacobs, I. M., & Wozencraft, J. M. (1965) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,912
A heuristic discussion of probabilistic decoding
Fano, R. (1963) · IEEE Transactions on Information Theory · doi:10.1109/tit.1963.1057827 · Cited by 494
Sequential decoding for reliable communication
Wozencraft, J. M. (1957) · Cited by 141
An upper bound on moments of sequential decoding effort
Jelinek, F. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054264 · Cited by 62
Self-citation
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
Forney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition
RABINER, L. R. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50027-9 · Cited by 1,869
A Maximum Likelihood Approach to Continuous Speech Recognition
Bahl, L. R., Jelinek, F., & Mercer, R. L. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767370 · Cited by 1,212
Self-citationHidden Markov Models for Speech Recognition
Juang, B. H., & Rabiner, L. R. (1991) · Technometrics · doi:10.1080/00401706.1991.10484833 · Cited by 1,068
Convolutional Codes and Their Performance in Communication Systems
Viterbi, A. (1971) · IEEE Transactions on Communication Technology · doi:10.1109/tcom.1971.1090700 · Cited by 1,012
Levinson, S. E., Rabiner, L. R., & Sondhi, M. M. (1983) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1983.tb03114.x · Cited by 978
Continuous speech recognition by statistical methods
Jelinek, F. (1976) · Proceedings of the IEEE · doi:10.1109/proc.1976.10159 · Cited by 920
Self-citationFifty Years of MIMO Detection: The Road to Large-Scale MIMOs
Yang, S., & Hanzo, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2475242 · Cited by 814
Ephraim, Y., & Merhav, N. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003838 · Cited by 798
A syntax-based statistical translation model
Yamada, K., & Knight, K. (2001) · Proceedings of the 39th Annual Meeting on Association for Computational Linguistics - ACL '01 · doi:10.3115/1073012.1073079 · Cited by 728
The Application of Hidden Markov Models in Speech Recognition
Gales, M., & Young, S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981219 · Cited by 557
The Application of Hidden Markov Models in Speech Recognition
Gales, M., & Young, S. (2007) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000004 · Cited by 496
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
An inequality on guessing and its application to sequential decoding
Arikan, E. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481781 · Cited by 308
A statistical approach to language translation
Brown, P., Cocke, J., Pietra, S. D., Pietra, V. D., Jelinek, F., Mercer, R., & Roossin, P. (1988) · Proceedings of the 12th conference on Computational linguistics - · doi:10.3115/991635.991651 · Cited by 275
Self-citationFast Algorithms for Signal Processing
Blahut, R. E. (2010) · doi:10.1017/cbo9780511760921 · Cited by 274
Design of a linguistic statistical decoder for the recognition of continuous speech
Jelinek, F., Bahl, L., & Mercer, R. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055384 · Cited by 271
Self-citation
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
- 4
- 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
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.