Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes

Details Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes

2010-07-06

arxiv.org/abs/1007.0799v2

Computer Science

Information Theory

To appear in Proc. 6th International Symposium on Turbo Codes and Iterative Information Processing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fountain Codes with Multiplicatively Repeated Non-Binary LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-215886