1 paper · 1 filter
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…