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

Simple item page
dc.creatorLee, Ki-Moon
dc.creatorRadha, Hayder
dc.creatorKim, Beom-Jin
dc.date2009-01-13
dc.date2009-01-19
dc.date.accessioned2026-07-07T12:30:56Z
dc.date.available2026-07-07T12:30:56Z
dc.descriptionA 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.
dc.descriptionSubmitted to ISIT 2009, Seoul, Korea
dc.identifierhttps://arxiv.org/abs/0901.1762
dc.identifierhttp://arxiv.org/abs/0901.1762
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/216290
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.titleA Tight Estimate for Decoding Error-Probability of LT Codes Using Kovalenko's Rank Distribution
dc.typetext

Files

Collections

arXiv