Fountain Codes with Varying Probability Distributions

Details Fountain Codes with Varying Probability Distributions Fountain Codes with Varying Probability Distributions

2010-01-12

arxiv.org/abs/1001.1798v2

Computer Science

Information Theory

5 pages, 1 figure. Changes, including a different simulation example in Section IV, are made to improve clarity. Theory remain

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fountain Codes with Varying Probability Distributions 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 Varying Probability Distributions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fountain Codes with Varying Probability Distributions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-458897