2010/01/12 by Kai Fong Ernest Chong, Ernest Kurniawan, Chong, Kai Fong Ernest +5
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #06A06 #94B60 #Advanced Wireless Communication Techniques #Combinatorics (math.CO) #DNA and Biological Computing #Error Correcting Code Techniques #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #math.CO #math.IT #msc:06A06 #msc:94B60
paper · pdf · doi:10.48550/arxiv.1001.1798
5 pages, 1 figure. Changes, including a different simulation example in Section IV, are made to improve clarity. Theory remains unchanged. Resubmitted to the 6th International Symposium on Turbo Codes & Iterative Information Processing (ISTC 2010).
openalex publication_date 2010/01/12 · arxiv created 2010/04/07 · arxiv updated 2010/04/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Fountain codes are rateless erasure-correcting codes, i.e., an essentially infinite stream of encoded packets can be generated from a finite set of data packets. Several fountain codes have been proposed recently to minimize overhead, many of which involve modifications of the Luby transform (LT) code. These fountain codes, like the LT code, have the implicit assumption that the probability distribution is fixed throughout the encoding process. In this paper, we will use the theory of posets to show that this assumption is unnecessary, and by dropping it, we can achieve overhead reduction by as much as 64% lower than LT codes. We also present the fundamental theory of probability distribution designs for fountain codes with non-constant probability distributions that minimize overhead.