Rateless Resilient Network Coding Against Byzantine Adversaries

In this paper, the authors consider rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors known a priori to the encoder and decoder. However, in certain practical settings it may be necessary to operate without such a priori knowledge. They present rateless coding schemes for two adversarial models, where the source sends more redundancy over time, until decoding succeeds. The first model assumes there is a secret channel between the source and the destination that the adversaries cannot overhear.

Provided by: California Institute of Technology Topic: Networking Date Added: Feb 2013 Format: PDF

Find By Topic