Next: Cycle-free codes and graph-theoretic Up: Tanner-Graph Decoding Previous: Optimal cycle-free codes. Contents
In this section, we discuss three distinct topics: the connection between binary cycle-free codes and cut-set codes of a graph, the asymptotic behavior of Tanner graphs with cycles, and the extension of the results of the previous section to general Tanner graphs.