Zig-zag and Replacement Product Graphs and LDPC Codes
Abstract
The performance of codes defined from graphs depends on the expansion property of the underlying graph in a crucial way. Graph products, such as the zig-zag product and replacement product provide new infinite families of constant degree expander graphs. The 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.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2006
- DOI:
- 10.48550/arXiv.cs/0611155
- arXiv:
- arXiv:cs/0611155
- Bibcode:
- 2006cs.......11155K
- Keywords:
-
- Computer Science - Information Theory
- E-Print:
- Submitted to Journal of Advances in Mathematics of Communications, Aug. 2007