https://wiki.sarg.dev/index.php?action=history&feed=atom&title=Sparse_graph_code 2026-04-15T05:29:08Z Revision history for this page on the wiki MediaWiki 1.44.2 https://wiki.sarg.dev/index.php?title=Sparse_graph_code&diff=332627&oldid=prev 2023-08-12T18:52:37Z

<p><span class="autocomment">External links</span></p> <p><b>New page</b></p><div>A &#039;&#039;&#039;Sparse graph code&#039;&#039;&#039; is a [[code]] which is represented by a [[sparse graph]].<br /> <br /> Any [[linear code]] can be represented as a graph, where there are two sets of nodes - a set representing the transmitted [[bit]]s and another set representing the constraints that the transmitted bits have to satisfy. The state of the art classical [[error-correcting code]]s are based on sparse graphs, achieving close to the [[Shannon limit]]. The archetypal sparse-graph codes are [[Robert G. Gallager|Gallager&#039;s]] [[low-density parity-check code]]s.<br /> <br /> == External links ==<br /> * [http://www.inference.phy.cam.ac.uk/mackay/itila/ The on-line textbook: Information Theory, Inference, and Learning Algorithms], by [[David J.C. MacKay]], discusses sparse-graph codes in Chapters 47–50.<br /> *[http://www.inference.phy.cam.ac.uk/mackay/codes/data.html Encyclopedia of Sparse Graph Codes]<br /> * [http://www.cambridge.org/gb/knowledge/isbn/item2711886/?site_locale=en_GB Iterative Error Correction: Turbo, Low-Density Parity-Check, and Repeat-Cccumulate Codes]<br /> <br /> [[Category:Matrix theory]]<br /> [[Category:Error detection and correction]]<br /> <br /> <br /> {{matrix-stub}}</div>

imported>Fadesga