Network RS Codes For Efficient Network Adversary Localization
Network error localizations uses end-to-end observations to localize random or adversarial glitches. For error localization under Random Linear Network Codes (RLNCs) the schemes proposed in previous literatures require the priori knowledge of the network topology. Moreover, adversarial error localization is proved computationally intractable under RLNCs. The goal of current paper is designing new network coding schemes to improve the error localization performance of RLNCs while maintaining the key advantages of RLNCs. To be concrete, the authors introduce Network Reed-Solomon Codes (NRSCs), which have the following features: NRSCs are low-complexity distributed linear network codes. NRSCs achieve the network multicast capacity with high probability. In adversarially faulty networks NRSCs enable the receiver to locate a maximum number of adversarial errors in a computationally efficient manner.