Zig-zag and Replacement Product Graphs and LDPC Codes

It is known that the expansion property of a graph influences the performance of the corresponding code when decoded using iterative algorithms. Certain graph products may be used to obtain larger expander graphs from smaller ones. In particular, the zig-zag product and replacement product may be used to construct infinite families of constant degree expander graphs. This paper investigates the use of zig-zag and replacement product graphs for the construction of codes on graphs. A modification of the zig-zag product is also introduced, which can operate on two unbalanced biregular bipartite graphs, and a proof of the expansion property of this modified zig-zag product is presented.

• Type: Journal
• Year: 2006
• Where: CORR
• Authors: Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal
• Keywords: CORR 2006, Education, Expansion Property, Larger Expander Graphs, Zig-zag Product