The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Class of algorithms for decoding block codes with channel measurement information
Abstract
A class of decoding algorithms that utilizes channel measurement information, in addition to the conventional use of the algebraic properties of the code, is presented. The maximum number of errors that can, with high probability, be corrected is equal to one less thand, the minimum Hamming distance of the code. This two-fold increase over the error-correcting capability of a conventional binary decoder is achieved by using channel measurement (soft-decision) information to provide a measure of the relative reliability of each of the received binary digits. An upper bound on these decoding algorithms is derived, which is proportional to the probability of an error fordth order diversity, an expression that has been evaluated for a wide range of communication channels and modulation techniques. With the aid of a lower bound on these algorithms, which is also a lower bound on a correlation (maximum-likelihood) decoder, we show for both the Gaussian and Rayleigh fading channels, that as the signal-to-noise ratio (SNR) increases, the asymptotic behavior of these decoding algorithms cannot be improved. Computer simulations indicate that even for !ow SNR the performance of a correlation decoder can be approached by relatively simple decoding procedures. In addition, we study the effect on the performance of these decoding algorithms when a threshold is used to simplify the decoding process.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Gallager, R. G., & Peterson, W. W. (1962) · Mathematics of Computation · doi:10.2307/2003832 · Cited by 2,041
Principles of Communication Engineering
Jacobs, I. M., & Wozencraft, J. M. (1965) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,912
Mann, H. B. (1961) · Technometrics · doi:10.1080/00401706.1961.10489978 · Cited by 1,069
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_9 · Cited by 751
Generalized minimum distance decoding
Forney, G. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053873 · Cited by 565
A decoding procedure for multiple-error-correcting cyclic codes
Kasami, T. (1964) · IEEE Transactions on Information Theory · doi:10.1109/tit.1964.1053649 · Cited by 93
Cited by
OFDM and MC‐CDMA for Broadband Multi‐User Communications, WLANs and Broadcasting
Hanzo, L., Münster, M., Choi, B. J., & Keller, T. (2003) · Wiley eBooks · doi:10.1002/9780470861813 · Cited by 1,095
Modulation and coding for linear Gaussian channels
Forney, G. D., & Ungerboeck, G. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720542 · Cited by 597
Turbo Coding, Turbo Equalisation and Space‐Time Coding: For Transmission over Fading Channels
Hanzo, L., Liew, T. H., & Yeap, B. L. (2002) · Wiley eBooks · doi:10.1002/047085474x · Cited by 449
Channel coding: The road to channel capacity
Costello, D. J., & Forney, G. D. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.895188 · Cited by 408
The Art of Error Correcting Coding
Morelos‐Zaragoza, R. H. (2002) · Wiley eBooks · doi:10.1002/0470847824 · Cited by 376
Metadata
- Authors
- Chase, D.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1972-01
- Volume
- 18
- Issue
- 1
- Pages
- 170-182
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2023355697
- Cited by
- 1,105
- References
- 10
- FWCI
- 6.05
- 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: Class of algorithms for decoding block codes with channel measurement information. https://app.cochat.ai/papers/10.1109/tit.1972.1054746
- The paper
- Chase, D. (1972). Class of algorithms for decoding block codes with channel measurement information. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1972.1054746
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.