Brief Announcment: Corruption Resilient Fountain Codes

  • Authors:

  • Shlomi Dolev;Nir Tzachar

  • Affiliations:

  • Department of Computer Science, Ben Gurion University of the Negev, Israel;Department of Computer Science, Ben Gurion University of the Negev, Israel

  • Venue:
  • DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
  • Year:
  • 2008

  • LT Codes

    FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science

  • Raptor codes

    IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new aspect for erasure coding is considered, namely, the possibility that some portion of the arriving packets are corrupted in an undetectable fashion. In practice, the corrupted packets may be attributed to a portion of the communication paths that are leading to the receiver and are controlled by an adversary. Alternatively, in case packets are collected from several sources, the corruption may be attributed to a portion of the sources that are malicious.