Software for Low Density Parity Check Codes This collection of programs and modules, written in C, is intended to support research and education concerning Low Density Parity Check (LDPC) codes. (Note, however, that the copyright notice no longer restricts use to these purposes). These error-correcting codes were invented by Robert Gallager in the early 1960’s, and re-invented and shown to have very good performance by David MacKay and myself in the mid-1990’s. The decoding algorithm for LDPC codes is related to that used for Turbo codes, and to probabilistic inference methods used in other fields. Variations on LDPC and Turbo codes are currently the best practical codes known, in terms of their ability to transmit data at rates approaching channel capacity with very low error probability. This and past versions of the software are available here, from Radford Neal’s web page. The source code for this software is also hosted at Github, where there is a copy of these documentation pages for the latest release. Github also provides facilities for bug reporting and discussion.

References in zbMATH (referenced in 84 articles )

Showing results 1 to 20 of 84.
Sorted by year (citations)

1 2 3 4 5 next

  1. Crnković, Dean; Rukavina, Sanja; Šimac, Marina: LDPC codes from cubic semisymmetric graphs (2022)
  2. Donovan, Diane; Price, Aiden; Rao, Asha; Üsküplü, Elif; ŞYazıcı, Emine: High-rate LDPC codes from partially balanced incomplete block designs (2022)
  3. Alfarano, Gianira N.; Lieb, Julia; Rosenthal, Joachim: Construction of LDPC convolutional codes via difference triangle sets (2021)
  4. Kabakulak, Banu; Taşkın, Z. Caner; Pusane, Ali Emre: A branch-cut-and-price algorithm for optimal decoding in digital communication systems (2021)
  5. Nassaj, A.; Naghipour, A. R.: On the class of array-based APM-LDPC codes (2021)
  6. Singh, Jasvinder; Gupta, Manish; Bhullar, Jaskarn Singh: On the search of smallest QC-LDPC code with girth six and eight (2020)
  7. Trifina, Lucian; Tarniceriu, Daniela; Ryu, Jonghoon; Rotopanescu, Ana-Mirela: Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers (2020)
  8. Crnković, Dean; Rukavina, Sanja; Šimac, Marina: LDPC codes from (\mu)-geodetic graphs obtained from block designs (2019)
  9. Liu, Jie; Tong, Xiaojun; Wang, Zhu; Ma, Jing; Yi, Longteng: An improved Rao-Nam cryptosystem based on fractional order hyperchaotic system and EDF-QC-LDPC (2019)
  10. Trifina, Lucian; Tarniceriu, Daniela: Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers (2019)
  11. Zhang, Meixiang; Chan, Satya; Kim, Sooyoung: Soft iterative decoding algorithms for rateless codes in satellite systems (2019)
  12. Kositwattanarerk, Wittawat: Pseudocodeword-free criterion for codes with cycle-free Tanner graph (2018)
  13. Chao, Fugang; Ren, Han; Cao, Ni: Finding shorter cycles in a weighted graph (2016)
  14. Lin, Kuang-Hao; Lin, Meng-Yi: High-throughput architectures for circular block-type low-density parity-check codes (2015)
  15. Li, Zhao-xiang; Ren, Han: The cycle’s structure of embedded graphs in surfaces (2015)
  16. Mu, Liwei; Liu, Xingcheng; Liang, Chulong: Improved construction of LDPC convolutional codes with semi-random parity-check matrices (2014)
  17. Suresh Kumar, S.; Rajaram, M.: On analyzing LDPC codes over multiantenna MC-CDMA system (2014)
  18. Wang, Xiuni; Ma, Xiao; Bai, Baoming: Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation (2014)
  19. Hwang, Yongsoo; Chung, Youngjoo; Jeon, Moongu: A class of quantum low-density parity check codes by combining seed graphs (2013)
  20. Mofrad, Asieh A.; Sadeghi, M.-R.; Panario, D.: Solving sparse linear systems of equations over finite fields using bit-flipping algorithm (2013)

1 2 3 4 5 next

Further publications can be found at: http://www.cs.utoronto.ca/~radford/ftp/LDPC-2012-02-11/refs.html