Zig-zag and Replacement Product Graphs and LDPC Codes

Simple item page
dc.creatorKelley, Christine A.
dc.creatorSridhara, Deepak
dc.creatorRosenthal, Joachim
dc.date2006-11-30
dc.date2007-08-20
dc.date.accessioned2026-07-07T08:24:09Z
dc.date.available2026-07-07T08:24:09Z
dc.descriptionThe 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.
dc.descriptionSubmitted to Journal of Advances in Mathematics of Communications, Aug. 2007
dc.identifierhttps://arxiv.org/abs/cs/0611155
dc.identifierhttp://arxiv.org/abs/cs/0611155
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136245
dc.subjectInformation Theory
dc.titleZig-zag and Replacement Product Graphs and LDPC Codes
dc.typetext

Files

Collections

arXiv