(IRA) codes which asymptotically (as their block length tends to infinity) achieve capacity on
the binary erasure channel (BEC) with bounded complexity per information bit. This is in
contrast to all previous constructions of capacity-achieving sequences of ensembles whose
complexity grows at least like the log of the inverse of the gap (in rate) to capacity. The new
bounded complexity result is achieved by puncturing bits, and allowing in this way a …