2015/02/05 by Francisco Lázaro, Lázaro, Francisco, Enrico Paolini +5
Computer Science · Mathematics · #Advanced Data Storage Technologies #Algorithms and Data Compression #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1502.01567
This paper will be presented at the 2015 IEEE International Symposium on Information Theory
openalex publication_date 2015/02/05 · arxiv created 2015/04/21 · arxiv updated 2015/04/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper Raptor code ensembles with linear random precodes in a fixed-rate setting are considered. An expression for the average distance spectrum is derived and this expression is used to obtain the asymptotic exponent of the weight distribution. The asymptotic growth rate analysis is then exploited to develop a necessary and sufficient condition under which the fixed-rate Raptor code ensemble exhibits a strictly positive typical minimum distance.