The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
The Art of Error Correcting Coding
Open accessAbstract
Designations used by
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
(1988) · Cited by 16,582
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
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
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
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665
Near Shannon limit error-correcting coding and decoding : Turbo-codes
Berrou, C. (1993) · International Conference on Communications · Cited by 4,264
Channel coding with multilevel/phase signals
Ungerboeck, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056454 · Cited by 3,751
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,662
Design of capacity-approaching irregular low-density parity-check codes
Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910578 · Cited by 3,335
ERROR DETECTING AND ERROR CORRECTING CODES
Chauhan, N., Yadav, P., & Kumari, P. (2014) · Cited by 3,270
A recursive approach to low complexity codes
Tanner, R. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056404 · Cited by 3,138
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
Near Shannon limit performance of low density paritycheck codes
MacKay, D. J. C., & Neal, R. M. (1997) · Electronics Letters · doi:10.1049/el:19970362 · Cited by 2,678
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
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
Iterative decoding of binary block and convolutional codes
Hagenauer, J., Offer, E., & Papke, L. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485714 · Cited by 2,303
Shift-register synthesis and BCH decoding
Massey, J. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054260 · Cited by 2,186
Rate-compatible punctured convolutional codes (RCPC codes) and their applications
Hagenauer, J. (1988) · IEEE Transactions on Communications · doi:10.1109/26.2763 · Cited by 1,827
A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
Robertson, P., Villebrun, E., & Hoeher, P. (2002) · Proceedings IEEE International Conference on Communications ICC '95 · doi:10.1109/icc.1995.524253 · Cited by 1,695
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
Chung, S.-Y., Forney, G. D., Richardson, T. J., & Urbanke, R. (2001) · IEEE Communications Letters · doi:10.1109/4234.905935 · Cited by 1,539
Error-Correction Coding for Digital Communications
Clark, G. C., & Cain, J. B. (1981) · Springer eBooks · doi:10.1007/978-1-4899-2174-1 · Cited by 1,317
Low-density parity-check codes based on finite geometries: a rediscovery and new results
Kou, Y., Lin, S., & Fossorier, M. P. C. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959255 · Cited by 1,302
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
Benedetto, S., Divsalar, D., Montorsi, G., & Pollara, F. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.669119 · Cited by 1,261
Unveiling turbo codes: some results on parallel concatenated coding schemes
Benedetto, S., & Montorsi, G. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485713 · Cited by 1,142
Class of algorithms for decoding block codes with channel measurement information
Chase, D. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054746 · Cited by 1,105
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
Fossorier, M. P. C., Mihaljevic, M., & Imai, H. (1999) · IEEE Transactions on Communications · doi:10.1109/26.768759 · Cited by 1,041
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
Sipser, M., & Spielman, D. A. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556667 · Cited by 931
Codes and Decoding on General Graphs
Wiberg, N. (1996) · Cited by 869
Trellis-coded modulation with redundant signal sets Part I: Introduction
Ungerboeck, G. (1987) · IEEE Communications Magazine · doi:10.1109/mcom.1987.1093542 · Cited by 802
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
Sudan, M. (1997) · Journal of Complexity · doi:10.1006/jcom.1997.0439 · Cited by 723
Codes on graphs: normal realizations
Forney, G. D. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910573 · Cited by 642
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
Convergence of iterative decoding
ten Brink, S. (1999) · Electronics Letters · doi:10.1049/el:19990555 · Cited by 575
Generalized minimum distance decoding
Forney, G. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053873 · Cited by 565
Singleton, R. (1964) · IEEE Transactions on Information Theory · doi:10.1109/tit.1964.1053661 · Cited by 533
Coding theorems for 'turbo-like' codes
Divsalar, D. (1998) · Medical Entomology and Zoology · Cited by 524
Gray, R. M. (2011) · Entropy and Information Theory · doi:10.1007/978-1-4419-7970-4_14 · Cited by 392
Turbo codes for PCS applications
Divsalar, D., & Pollara, F. (2002) · Proceedings IEEE International Conference on Communications ICC '95 · doi:10.1109/icc.1995.525138 · Cited by 386
On linear unequal error protection codes
Masnick, B., & Wolf, J. K. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054054 · Cited by 363
High-Rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding
Yasuda, Y., Kashiki, K., & Hirata, Y. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096047 · Cited by 344
Near optimum decoding of product codes
Pyndiah, R. M., Glavieux, A., Picart, A., & Jacq, S. (2002) · Globecom · doi:10.1109/glocom.1994.513494 · Cited by 291
A pragmatic approach to trellis-coded modulation
Viterbi, A. J., Wolf, J. K., Zehavi, E., & Padovani, R. (1989) · IEEE Communications Magazine · doi:10.1109/35.31452 · Cited by 259
A Class of Binary Signaling Alphabets
Slepian, D. (1956) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1956.tb02379.x · Cited by 195
Garello, R., Pierleoni, P., & Benedetto, S. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.924864 · Cited by 189
Interleaver design for turbo codes
Barbulescu, A. S., & Pietrobon, S. S. (1994) · Electronics Letters · doi:10.1049/el:19941434 · Cited by 148
Interleaver design for turbo codes
Sadjadpour, H. R., Sloane, N. J. A., Salehi, M., et al. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.924867 · Cited by 140
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
Error-correcting barcoded primers for pyrosequencing hundreds of samples in multiplex
Hamady, M., Walker, J. J., Harris, J. K., Gold, N. J., & Knight, R. (2008) · Nature Methods · doi:10.1038/nmeth.1184 · Cited by 1,310
Metadata
- Authors
- Morelos‐Zaragoza, R. H.
- Venue
- Wiley eBooks
- Publisher
- Wiley
- Published
- 2002-03-11
- OpenAlex
- W1535801681
- Cited by
- 376
- References
- 49
- FWCI
- 2.10
- Type
- book
- Language
- en
- Open access
- bronze
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.