Computer Science – Information Theory
Scientific paper
2011-11-27
Computer Science
Information Theory
23 pages, 5 figure
Scientific paper
In this paper, we present a new family of fountain codes which overcome adversarial errors. That is, we consider the possibility that some portion of the arriving packets of a rateless erasure code are corrupted in an undetectable fashion. In practice, the corrupted packets may be attributed to a portion of the communication paths which are controlled by an adversary or to a portion of the sources that are malicious. The presented codes resemble and extend LT and Raptor codes. Yet, their benefits over existing coding schemes are manifold. First, to overcome the corrupted packets, our codes use information theoretic techniques, rather than cryptographic primitives. Thus, no secret channel between the senders and the receivers is required. Second, the encoders in the suggested scheme are oblivious to the strength of the adversary, yet perform as if its strength was known in advance. Third, the sparse structure of the codes facilitates efficient decoding. Finally, the codes easily fit a decentralized scenario with several sources, when no communication between the sources is allowed. We present both exhaustive as well as efficient decoding rules. Beyond the obvious use as a rateless codes, our codes have important applications in distributed computing.
Cohen Asaf
Dolev Shlomi
Tzachar Nir
No associations
LandOfFree
Efficient and Universal Corruption Resilient Fountain 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 Efficient and Universal Corruption Resilient Fountain Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient and Universal Corruption Resilient Fountain Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-687099