2009/01/13 by Ki-Moon Lee, Lee, Ki-Moon, Hayder Radha +3
Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.DM #cs.IT #math.CO #math.IT
paper · pdf · doi:10.48550/arxiv.0901.1762
Submitted to ISIT 2009, Seoul, Korea
arxiv created 2009/01/19 · arxiv updated 2009/12/01
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.