164 citations · 1.2k across the 72 of their papers we have counts for
Showing 2004Show all
2 papers · 1 filter
cs.IT2004★ 3 cited
Bounds on the decoding complexity of punctured codes on graphs
H. Pfister, I. Sason, R. Urbanke
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bin…
cs.IT2004★ 164 cited
Capacity-achieving ensembles for the binary erasure channel with bounded complexity
H. Pfister, I. Sason, R. Urbanke
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bin…