Talk:Low-density parity-check code: Difference between revisions

Revision as of 00:55, 27 September 2015

Revision as of 21:22, 6 March 2016

Line 40:

In the paper that effectively reintroducted LDPC codes (MacKay and Neal "Near Shannon Limit Performance of Low Density Parity Check Codes") there is a brief mention of this topic. The suggestion is that a slightly related family of codes (concatenated codes) were believed to be better and hence LDPC codes were ignored. This paper cites personal communication from Gallager on this topic. [[User:Edratzer|Edratzer]] 17:25, 17 September 2006 (UTC)

LDPC codes were actually rediscovered one year before MacKay and Neal, by Wiberg, Loeliger, and Kötter in "Codes and Iterated Decoding on General Graphs", published in 1995. This was triggered by the publication of Turbo codes in 1993, which sparked the new interest in iterative decoding algorithms. This page should be updated with a reference to that paper. [[User:Nicwi|Nicwi]] ([[User talk:Nicwi|talk]]) 21:21, 6 March 2016 (UTC)

== Links ==