A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf
.
Refined Coding Bounds and Code Constructions for Coherent Network Error Correction
2011
IEEE Transactions on Information Theory
Coherent network error correction is the error-control problem in network coding with the knowledge of the network codes at the source and sink nodes. With respect to a given set of local encoding kernels defining a linear network code, we obtain refined versions of the Hamming bound, the Singleton bound and the Gilbert-Varshamov bound for coherent network error correction. Similar to its classical counterpart, this refined Singleton bound is tight for linear network codes. The tightness of
doi:10.1109/tit.2011.2106930
fatcat:sxlq6ls5szgy5f2hkaupt445ge