The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Efficient encoding of low-density parity-check codes
Open accessAbstract
Low-density parity-check (LDPC) codes can be considered serious competitors to turbo codes in terms of performance and complexity and they are based on a similar philosophy: constrained random code ensembles and iterative decoding algorithms. We consider the encoding problem for LDPC codes. More generally we consider the encoding problem for codes specified by sparse parity-check matrices. We show how to exploit the sparseness of the parity-check matrix to obtain efficient encoders. For the (3,6)-regular LDPC code, for example, the complexity of encoding is essentially quadratic in the block length. However, we show that the associated coefficient can be made quite small, so that encoding codes even of length n/spl sime/100000 is still quite practical. More importantly, we show that "optimized" codes actually admit linear time encoding.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
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
Self-citationA 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
Self-citationTheory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
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
Near Shannon limit performance of low density paritycheck codes
MacKay, D. J. C., & Neal, R. M. (1996) · Electronics Letters · doi:10.1049/el:19961141 · Cited by 1,923
Cited by
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
Self-citationInformation, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Regular and irregular progressive edge-growth tanner graphs
Hu, X.-Y., Eleftheriou, E., & Arnold, D. M. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839541 · Cited by 1,485
MacKay, D. J. C. (2005) · IEE Proceedings - Communications · doi:10.1049/ip-com:20050237 · Cited by 899
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601982414 · Cited by 686
NR: The New 5G Radio Access Technology
Parkvall, S., Dahlman, E., Furuskar, A., & Frenne, M. (2017) · IEEE Communications Standards Magazine · doi:10.1109/mcomstd.2017.1700042 · Cited by 634
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2009) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000036 · Cited by 570
Efficient encoding of quasi-cyclic low-density parity-check codes
Li, Z., Chen, L., Zeng, L., Lin, S., & Fong, W. H. (2006) · IEEE Transactions on Communications · doi:10.1109/tcomm.2005.861667 · Cited by 463
Applications of LDPC Codes to the Wiretap Channel
Thangaraj, A., Dihidar, S., Calderbank, A. R., McLaughlin, S. W., & Merolla, J.-M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.901143 · Cited by 455
Sparse-Graph Codes for Quantum Error Correction
MacKay, D. J. C., Mitchison, G., & McFadden, P. L. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834737 · Cited by 376
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels
Bennatan, A., & Burshtein, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862080 · Cited by 267
Lan, L., Zeng, L., Tai, Y. Y., Chen, L., Lin, S., & Abdel-Ghaffar, K. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.899516 · Cited by 263
Design of repeat-accumulate codes for iterative detection and decoding
ten Brink, S., & Kramer, G. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.818250 · Cited by 258
Joint FEC/CRC coding scheme for energy constrained IOT devices
Ez-zazi, I., Arioua, M., El Oualkadi, A., & el Assari, Y. (2017) · Proceedings of the International Conference on Future Networks and Distributed Systems · doi:10.1145/3102304.3102329 · Cited by 10
Metadata
- Authors
- Richardson, T. J., & Urbanke, R. L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2001
- Volume
- 47
- Issue
- 2
- Pages
- 638-656
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2140655888
- Cited by
- 1,028
- References
- 15
- FWCI
- 41.47
- Type
- journal article
- Language
- en
- Open access
- green
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.