vix.ing · top · new · best · stats · spec

On the Concatenation of Non-Binary Random Linear Fountain Codes with Maximum Distance Separable Codes

2011/11/14 by Francisco Lázaro Blasco, Francisco Lazaro Blasco, Blasco, Francisco Lazaro +2
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #DNA and Biological Computing #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1111.3166

IEEE International Conference on Communications 2011

arxiv created 2011/11/14 · openalex publication_date 2011/11/14 · arxiv updated 2011/11/15 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28

Abstract

A novel fountain coding scheme has been introduced. The scheme consists of a parallel concatenation of a MDS block code with a LRFC code, both constructed over the same field, Fq. The performance of the concatenated fountain coding scheme has been analyzed through derivation of tight bounds on the probability of decoding failure as a function of the overhead. It has been shown how the concatenated scheme performs as well as LRFC codes in channels characterized by high erasure probabilities, whereas they provide failure probabilities lower by several orders of magnitude at moderate/low erasure probabilities.

Related