IEEE Transactions on Information Theory · 2009 · 169 citations · 15 references
EngineeringComputer EngineeringComputer ScienceComputer NetworksFault-tolerant ComputingInformation TheoryChannel CodingCoding TheoryError Control CodingError CorrectionError-correcting CodesNetwork Information TheoryBounds On CodesCode ConstructionsDecoder DesignError Correction CodesNetwork CodingNoncoherent CommunicationRank-metric CodesSubspace Codes
The problem of error correction in both coherent and noncoherent network coding is considered under an adversarial model. For coherent network coding, where knowledge of the network topology and network code is assumed at the source and destination nodes, the error correction capability of an (outer) code is succinctly described by the rank metric; as a consequence, it is shown that universal network error correcting codes achieving the Singleton bound can be easily constructed and efficiently decoded. For noncoherent network coding, where knowledge of the network topology and network code is not assumed, the error correction capability of a (subspace) code is given exactly by a new metric, called the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">injection metric</i> , which is closely related to, but different than, the subspace metric of KOumltter and Kschischang. In particular, in the case of a non-constant-dimension code, the decoder associated with the injection metric is shown to correct more errors then a minimum-subspace-distance decoder. All of these results are based on a general approach to adversarial error correction, which could be useful for other adversarial channels beyond network coding.
15
Resilient network coding in the presence of Byzantine adversaries
Sidharth Jaggi, Michael Langberg, S. Katti et al. · 2007 · 373 citations
Network Error Correction, I: Basic Concepts and Upper Bounds
Ning Cai, Ning Cai, Raymond W. Yeung et al. · Communications in Information and Systems · 2006 · 323 citations · Full text