The Singleton Bound for Network Error-Correcting Codes

摘要

Inspired by network coding, network error-correcting codes was introduced in [1] for multicasting a source message to a set of nodes on a network. The usual approach in existing networks, namely link-by-link error correction, is a special case of network error correction. In [1], network generalizations of the Hamming bound and the Gilbert-Varshamov bound were obtained. In this paper, we prove the network generalizations of the Singleton Bound and its tightness.