Some new Algebraic constructions of Codes from Graphs which are good Expanders
Christine A. Kelley, Joachim Rosenthal, Deepak Sridhara · 2003
The design of LDPC codes based on a class of expander graphs is investigated. Graph products, such as the zig-zag product [9], of smaller expander graphs have been shown to yield larger expanders. LDPC codes are designed based on the zigzag product graph of two component Cayley graphs. The results for specific cases simulated reveal that the resulting LDPC codes compare well with other random LDPC codes at short block lengths – suggesting that product graphs form yet another avenue to pursue in the design of codes over graphs. 1