Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-12668
Kelley, C; Sridhara, D; Rosenthal, J (2008). Zig-zag and replacement product graphs and LDPC codes. Advances in Mathematics of Communications, 2(4):347-372.
- Registered users only
PDF (Accepted manuscript, Version 2)
PDF (Accepted manuscript, Version 1)
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.
|Item Type:||Journal Article, refereed, original work|
|Communities & Collections:||07 Faculty of Science > Institute of Mathematics|
|Deposited On:||09 Feb 2009 16:01|
|Last Modified:||27 Nov 2013 22:16|
|Publisher:||American Institute of Mathematical Sciences|
|Citations:||Web of Science®. Times Cited: 2|
Scopus®. Citation Count: 3
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page