• Corpus ID: 14916197

Network Coding , Algebraic Coding , and Network Error Correction

@inproceedings{Yeung2006NetworkC,
  title={Network Coding , Algebraic Coding , and Network Error Correction},
  author={Raymond W. Yeung},
  year={2006}
}

• R. Yeung
• Published 2006
• Computer Science

This paper discussesthe relation between network coding, (classical)algebraic coding, and network error correction. In the first part, we clarify the relation between network coding and algebraic coding. By showing that the Singleton bound in algebraic coding theory is a special case of the Maxflow Min-cut bound in network coding theory, we formally establishthat linear multicast and its stronger versions are network generalizations of a maximum distance separation (MDS) code. In the secondpart, we first give an overview of network error correction,a paradigm for error correction on networks which can be regardedas an extensionof classicalpoint-to-point error correction. Then by means of an example, we show that an upper bound in terms of classicalerrorcorrecting codes is not tight even for a simple class of networks called regular networks. This illustrates the complexity involved in the construction of network error-correcting codes.