4 papers · 1 filter
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…
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…
Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights
Christine Kelley, Deepak Sridhara, Joachim Rosenthal
We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decodin…
Pseudocodewords of Tanner graphs
Christine A. Kelley, Deepak Sridhara
This papers presents a detailed analysis of pseudocodewords of Tanner graphs. Pseudocodewords arising on the iterative decoder's computation tree are distinguished from pseudocodew…