Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Sparse graph code
open-in-new
<p>A Sparse graph code is a <a href="/facts/Code/CSntvnEo">code</a> which is represented by a <a href="/facts/Sparse_graph/xFC7b7s9">sparse graph</a>. </p><p>Any <a href="/facts/Linear_code/HoFI3eyF">linear code</a> can be represented as a graph, where there are two sets of nodes - a set representing the transmitted <a href="/facts/Bit/S972NSaD">bits</a> and another set representing the constraints that the transmitted bits have to satisfy. The state of the art classical <a href="/facts/Error-correcting_code/cLUTUJrA">error-correcting codes</a> are based on sparse graphs, achieving close to the <a href="/facts/Shannon_limit/vvr8u4Gg">Shannon limit</a>. The archetypal sparse-graph codes are <a href="/facts/Robert_G._Gallager/TKIMEgPR">Gallager's</a> <a href="/facts/Low-density_parity-check_code/yPYHEKAP">low-density parity-check codes</a>. </p>