Binary Error Correcting Network Codes
The authors consider network coding for networks experiencing worst-case bit-flip errors, and argue that this is a reasonable model for highly dynamic wireless network transmissions. They demonstrate that in this setup prior network error-correcting schemes can be arbitrarily far from achieving the optimal network throughput. They propose a new metric for errors under this model. Using this metric, they prove a new Hamming type upper bound on the network capacity. They also show a commensurate lower bound based on GV-type codes that can be used for error-correction. The codes used to attain the lower bound are non-coherent (do not require prior knowledge of network topology).