Brief Announcment: Corruption Resilient Fountain Codes

  • Shlomi Dolev
  • Nir Tzachar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5218)


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.


Network Code Input Symbol Communication Path Decode Scheme Erasure Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Koetter, R., Kschischang, F.: Coding for Errors and Erasures in Random Network Coding,
  2. 2.
    Luby, M.: LT Codes. FOCS, 271–280 (2002)Google Scholar
  3. 3.
    Shokrollahi, A.: Raptor Codes. IEEE Trans. on Info. Theory 52, 2551–2567 (2006)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Shlomi Dolev
    • 1
  • Nir Tzachar
    • 1
  1. 1.Department of Computer ScienceBen Gurion University of the NegevIsrael

Personalised recommendations