On Equivalence for Networks of Noisy Channels Under Byzantine Attacks
The authors consider the problem of finding network coding capacities of networks of independent point-to-point channels in the presence of a Byzantine adversary. They assume that the adversary knows all messages, and noise values and the code used to communicate across the network. The adversary controls an unknown subset of edges and can replace the channel output vectors from those edges. They show that finding the capacity for the above network is equivalent to finding the capacity of a network that is obtained by replacing each finite input alphabet point-to-point channel by a noiseless link of the noisy channel capacity.