TY - GEN
T1 - Kovalenko's full-rank limit and overheads as lower bounds of error-performances of LDPC and LT codes over Binary Erasure Channels
AU - Lee, Ki Moon
AU - Radha, Hayder
AU - Kim, Beom Jin
AU - Song, Hong Yeop
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77951130438&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951130438&partnerID=8YFLogxK
U2 - 10.1109/ISITA.2008.4895488
DO - 10.1109/ISITA.2008.4895488
M3 - Conference contribution
AN - SCOPUS:77951130438
SN - 9781424420698
T3 - 2008 International Symposium on Information Theory and its Applications, ISITA2008
BT - 2008 International Symposium on Information Theory and its Applications, ISITA2008
T2 - 2008 International Symposium on Information Theory and its Applications, ISITA2008
Y2 - 7 December 2008 through 10 December 2008
ER -