Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Tight Estimate for Decoding Error-Probability of LT Codes Using Kovalenko's Rank Distribution

Published 13 Jan 2009 in cs.IT, cs.DM, math.CO, and math.IT | (0901.1762v2)

Abstract: A new approach for estimating the Decoding Error-Probability (DEP) of LT codes with dense rows is derived by using the conditional Kovalenko's rank distribution. The estimate by the proposed approach is very close to the DEP approximated by Gaussian Elimination, and is significantly less complex. As a key application, we utilize the estimates for obtaining optimal LT codes with dense rows, whose DEP is very close to the Kovalenko's Full-Rank Limit within a desired error-bound. Experimental evidences which show the viability of the estimates are also provided.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.