Network Error Correction With Unequal Link Capacities

We study network error correction with unequal link capacities. Previous results on network error correction assume unit link capacities. We consider network error correction codes that can correct arbitrary errors occurring on up to z links. We find the capacity of a network consisting of parallel links, and a generalized Singleton outer bound for any arbitrary network. We show by example that linear coding is insufficient for achieving capacity in general. In our example, the capacity is 50% greater than the linear coding capacity and we achieve using a nonlinear error detection strategy. We also present a method for finding an upper bound on the linear coding capacity for arbitrary network. We show that even for a single source and single sink network, it may be necessary for intermediate nodes to do coding, nonlinear error detection or error correction. This is unlike the equal link capacity case, where coding only at the source and forwarding at intermediate nodes suffices for a single source and sink network. We conjecture that the generalized Singleton outer bound is not achievable in general.

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

[2]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[3]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[4]  Guanfeng Liang,et al.  Capacity of Byzantine Agreement: Complete Characterization of Four-Node Networks ∗ , 2010 .

[5]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[6]  Frank R. Kschischang,et al.  A Rank-Metric Approach to Error Control in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[7]  Nitin H. Vaidya,et al.  When Watchdog Meets Coding , 2009, 2010 Proceedings IEEE INFOCOM.

[8]  Lang Tong,et al.  Nonlinear network coding is necessary to combat general Byzantine attacks , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2008, IEEE Trans. Inf. Theory.

[10]  Tracey Ho,et al.  Byzantine modification detection in multicast networks using randomized network coding , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[12]  David Mazières,et al.  On-the-fly verification of rateless erasure codes for efficient content distribution , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.

[13]  Shenghao Yang,et al.  Construction of Linear Network Codes that Achieve a Refined Singleton Bound , 2007, 2007 IEEE International Symposium on Information Theory.

[14]  Lang Tong,et al.  Polytope codes against adversaries in networks , 2010, 2010 IEEE International Symposium on Information Theory.

[15]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.

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

[17]  Tracey Ho,et al.  New results on network error correction: Capacities and upper bounds , 2010, 2010 Information Theory and Applications Workshop (ITA).

[18]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

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

[20]  Lang Tong,et al.  Polytope codes against adversaries in networks , 2010, ISIT.

[21]  Tracey Ho,et al.  Network error correction with unequal link capacities , 2009 .

[22]  Christos Gkantsidis,et al.  Cooperative Security for Network Coding File Distribution , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[23]  Zhen Zhang,et al.  Linear Network Error Correction Codes in Packet Networks , 2008, IEEE Transactions on Information Theory.

[24]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[26]  Raymond W. Yeung,et al.  Information Theory and Network Coding , 2008 .

[27]  Michael Langberg,et al.  Binary causal-adversary channels , 2009, 2009 IEEE International Symposium on Information Theory.

[28]  Shenghao Yang,et al.  Refined Coding Bounds for Network Error Correction , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.