2010/07/06 by Kenta Kasai, Kasai, Kenta, Kohichi Sakaniwa +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #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.1007.0799
To appear in Proc. 6th International Symposium on Turbo Codes and Iterative Information Processing
openalex publication_date 2010/07/06 · arxiv created 2010/07/11 · arxiv updated 2010/07/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study fountain codes transmitted over the binary-input symmetric-output channel. For channels with small capacity, receivers needs to collects many channel outputs to recover information bits. Since a collected channel output yields a check node in the decoding Tanner graph, the channel with small capacity leads to large decoding complexity. In this paper, we introduce a novel fountain coding scheme with non-binary LDPC codes. The decoding complexity of the proposed fountain code does not depend on the channel. Numerical experiments show that the proposed codes exhibit better performance than conventional fountain codes, especially for small number of information bits.