By Topic

Kovalenko's full-rank limit and overheads as lower bounds of error-performances of LDPC and LT codes over binary erasure channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ki-Moon Lee ; Dept of Inf. & Commun. Eng., Sungkyunkwan Univ., Suwon ; Radha, H. ; Beom-Jin Kim ; Hong-Yeop Song

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.

Published in:

Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on

Date of Conference:

7-10 Dec. 2008