Kovalenko's full-rank limit and overheads as lower bounds of error-performances of LDPC and LT codes over binary erasure channels
We present Kovalenko's full-rank limit as a tight probabilistic lower bound for error performances of LDPC codes and LT codes over BEC. From the limit, we derive a full-rank overhead as a tight lower-bound for stable overheads for successful maximum-likelihood decoding of the codes.