The Singleton Bound for Network Error-Correcting Codes

Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany

Proceedings: TURBO - CODING - 2006

Pages: 6Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Cai, Ning; Yeung, Raymond W. (Department of Information Engineering, The Chinese University of Hong Kong, N.T., Hong Kong)

Inspired by network coding, network error-correcting codes was introduced in "N. Cai, R. W. Yeung, Network coding and error correction" 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 "N. Cai, R. W. Yeung, Network coding and error correction", 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.