The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
Open accessAbstract
This paper introduces several new combinatorial constructions of low-density parity-check (LDPC) codes, in contrast to the prevalent practice of using long, random-like codes. The proposed codes are well structured, and unlike random codes can lend themselves to a very low-complexity implementation. Constructions of regular Gallager codes based on cyclic difference families, cycle-invariant difference sets, and affine 1-configurations are introduced. Several constructions of difference families used for code design are presented, as well as bounds on the minimal distance of the codes based on the concept of a generalized Pasch configuration.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
(1988) · Cited by 16,582
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
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 · cited 1×
“To visualize the decoding algorithm for LDPC codes, the parity-check matrix is represented as a bipartite graph with two types of vertices [8]–[10].”
MethodLow-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
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
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
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
Gallager, R. G., & Peterson, W. W. (1962) · Mathematics of Computation · doi:10.2307/2003832 · Cited by 2,041
CRC Handbook of Combinatorial Designs
(1996) · Discrete Mathematics and Its Applications · doi:10.1201/9781420049954 · Cited by 1,738
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
van Lint, J. H., & Wilson, R. M. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511987045 · Cited by 1,185
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
McEliece, R. J., MacKay, D. J. C., & Cheng, J.-F. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661103 · Cited by 904
The encyclopedia of integer sequences
(1995) · Choice Reviews Online · doi:10.5860/choice.33-2176 · Cited by 572
A Theorem in Finite Projective Geometry and Some Applications to Number Theory
Singer, J. (1938) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1938-1501951-4 · Cited by 570
Assmus, E. F., & Key, J. D. (1992) · Cambridge University Press eBooks · doi:10.1017/cbo9781316529836 · Cited by 569
ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
BOSE, R. C. (1939) · Annals of Eugenics · doi:10.1111/j.1469-1809.1939.tb02219.x · Cited by 559
Graphical models for machine learning and digital communication
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)90253-5 · Cited by 454
Good codes based on very sparse matrices
MacKay, D. J. C., & Neal, R. M. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60693-9_13 · Cited by 451
Iterative decoding of compound codes by probability propagation in graphical models
Kschischang, F. R., & Frey, B. J. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661110 · Cited by 388
Graphical Models for Machine Learning and Digital Communication
Frey, B. J. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/3348.001.0001 · Cited by 352
Codes and iterative decoding on general graphs
Wiberg, N., Loeliger, H., & Kotter, R. (1995) · European Transactions on Telecommunications · doi:10.1002/ett.4460060507 · Cited by 314
Beth, T., Jungnickel, D., & Lenz, H. J. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9781139507660 · Cited by 155
Applications of Combinatorial Designs to Communications, Cryptography, and Networking
Colbourn, C. J., Dinitz, J. H., & Stinson, D. R. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721335.004 · Cited by 146
High-Rate Girth-Eight Low-Density Parity-Check Codes on Rectangular Integer Lattices
Vasic, B. V., Pedagani, K., & Ivkovic, M. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.833037 · Cited by 61
Self-citation
Cited by
Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
Fossorier, M. P. C. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.831841 · Cited by 1,219
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
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
Metadata
- Authors
- Vasic, B., & Milenkovic, O.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2004-06
- Volume
- 50
- Issue
- 6
- Pages
- 1156-1176
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2119990840
- Cited by
- 263
- References
- 27
- FWCI
- 31.03
- 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.