Showing cs.ITShow all
2 papers · 1 filter
cs.IT2007
Eigenvalue bounds on the pseudocodeword weight of expander codes
Christine A. Kelley, Deepak Sridhara
Four different ways of obtaining low-density parity-check codes from expander graphs are considered. For each case, lower bounds on the minimum stopping set size and the minimum ps…
cs.IT2006
Zig-zag and Replacement Product Graphs and LDPC Codes
Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal
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…