Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels

Details Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels

2008-08-02

arxiv.org/abs/0808.0272v2

Computer Science

Information Theory

A short version of this paper was presented at ISITA 2008, Auckland NZ. The first draft was submitted to IEEE Transactions on

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-662402