By Topic

Upper bound on the error exponent of regular LDPC codes transmitted over the BEC

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
$33 $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

2 Author(s)
Idan Goldenberg ; School of Electrical Engineering, Tel-Aviv University, 69978, Israel ; David Burshtein

The error performance of the ensemble of typical LDPC codes transmitted over the binary erasure channel (BEC) is analyzed under iterative decoding. In the past, lower bounds on the error exponent were derived. In this paper a probabilistic upper bound on this error exponent is derived. This bound holds with some confidence level.

Published in:

2008 5th International Symposium on Turbo Codes and Related Topics

Date of Conference:

1-5 Sept. 2008