Characterization of error correction and detection in a general transmission system

In this paper, we study the error correction and detection capabilities of block codes for a general transmission system inspired by network error correction. For a given weight measure on the error vectors, we define a corresponding minimum weight decoder. Then we obtain a complete characterization of the capabilities of a block code for error correction and error detection. Our results imply that for a linear network code with the Hamming weight being the weight measure on the error vectors, the capability of the code is fully characterized by a single minimum distance. By contrast, for a nonlinear network code, two different minimum distances are needed for characterizing the capabilities of the code for error correction and for error detection. This leads to the surprising discovery that for a nonlinear network code, the number of correctable errors can be more than half of the number of detectable errors. We further define equivalence classes of weight measures with respect to a channel. Specifically, for any given code, the minimum distance decoders for two different weight measures are equivalent if the two weight measures belong to the same equivalence class.

[1]  Michael Langberg,et al.  Resilient network codes in the presence of eavesdropping Byzantine adversaries , 2007, 2007 IEEE International Symposium on Information Theory.

[2]  K. K. Chi,et al.  Analysis of network error correction based on network coding , 2005 .

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

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

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

[6]  Zhen Zhang,et al.  Weight properties of network codes , 2008, Eur. Trans. Telecommun..

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

[8]  Tracey Ho,et al.  Correction of adversarial errors in networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

[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 coding and error correction , 2002, Proceedings of the IEEE Information Theory Workshop.

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

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

[14]  Frank R. Kschischang,et al.  Using Rank-Metric Codes for Error Correction in Random Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.

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

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