Construction of Linear Network Codes that Achieve a Refined Singleton Bound

In this paper, we present a refined version of the Singleton bound for network error correction, and propose an algorithm for constructing network codes that achieve this bound.

[1]  Shuo-Yen Robert Li,et al.  Network Coding Theory - Part I: Single Source , 2005, Found. Trends Commun. Inf. Theory.

[2]  R. Yeung,et al.  NETWORK ERROR CORRECTION, PART II: LOWER BOUNDS , 2006 .

[3]  Ning Cai,et al.  Network coding and error correction , 2002, Proceedings of the IEEE Information Theory Workshop.

[4]  Ning Cai,et al.  Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory) , 2006 .

[5]  R. Yeung,et al.  Characterizations of Network Error Correction / Detection and Erasure Correction , 2007 .

[6]  R. Yeung,et al.  Network coding theory , 2006 .

[7]  Tracey Ho,et al.  Resilient network coding in the presence of Byzantine adversaries , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[8]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[9]  Ning Cai,et al.  Network Error Correction, I: Basic Concepts and Upper Bounds , 2006, Commun. Inf. Syst..

[10]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[11]  R. Yeung,et al.  NETWORK ERROR CORRECTION , PART I : BASIC CONCEPTS AND UPPER BOUNDS , 2006 .

[12]  Ning Cai,et al.  Network Error Correction, II: Lower Bounds , 2006, Commun. Inf. Syst..

[13]  Zhen Zhang,et al.  Network Error Correction Coding in Packetized Networks , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.