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 68 articles )

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

1 2 3 4 next

  1. Chao, Fugang; Ren, Han; Cao, Ni: Finding shorter cycles in a weighted graph (2016)
  2. Lin, Kuang-Hao; Lin, Meng-Yi: High-throughput architectures for circular block-type low-density parity-check codes (2015)
  3. Li, Zhao-xiang; Ren, Han: The cycle’s structure of embedded graphs in surfaces (2015)
  4. Mu, Liwei; Liu, Xingcheng; Liang, Chulong: Improved construction of LDPC convolutional codes with semi-random parity-check matrices (2014)
  5. Wang, Xiuni; Ma, Xiao; Bai, Baoming: Design of efficiently encodable nonbinary LDPC codes for adaptive coded modulation (2014)
  6. Hwang, Yongsoo; Chung, Youngjoo; Jeon, Moongu: A class of quantum low-density parity check codes by combining seed graphs (2013)
  7. Mofrad, Asieh A.; Sadeghi, M.-R.; Panario, D.: Solving sparse linear systems of equations over finite fields using bit-flipping algorithm (2013)
  8. Tuan, H.D.; Son, T.T.; Tuy, H.; Khoa, P.T.: Monotonic optimization based decoding for linear codes (2013)
  9. Gurcan, Mustafa K.; Weliwitegoda, Dhineth; Chandra, Girish: Improved equalization and joint iterative detection (2012)
  10. Limbupasiriporn, J.; Storme, L.; Vandendriessche, P.: Large weight code words in projective space codes (2012)
  11. Hanzo, Lajos L.; Maunder, Robert G.; Wang, Jin; Yang, Lie-Liang: Near-capacity variable-length coding. Regular and EXIT-chart-aided irregular designs. (2011)
  12. Joyner, David; Kim, Jon-Lark: Selected unsolved problems in coding theory. (2011)
  13. Ren, PinYi; Yuan, Qiang; Wang, Rui; Cai, Jun: Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth (2011)
  14. Vandendriessche, Peter: Codes of Desarguesian projective planes of even order, projective triads and $(q+t,t)$-arcs of type $(0, 2, t)$ (2011)
  15. Zhang, Guohua; Wang, Xinmei: A class of quasi-cyclic LDPC codes from $B_2\pmod m$ sequences (2011)
  16. Jiang, Yuan: A practical guide to error-control coding using MATLAB. With DVD. (2010)
  17. Kozlov, Inna; Petukhov, Alexander: Sparse solutions of underdetermined linear systems (2010)
  18. Mohsenin, Tinoosh; Baas, Bevan M.: A split-decoding message passing algorithm for low density parity check decoders (2010)
  19. Pepe, Valentina; Storme, Leo; Van de Voorde, Geertrui: On codewords in the dual code of classical generalised quadrangles and classical polar spaces (2010)
  20. Psota, Eric; Pérez, Lance C.: The manifestation of stopping sets and absorbing sets as deviations on the computation trees of LDPC codes (2010)

1 2 3 4 next

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