Refined Coding Bounds for Network Error Correction
Shenghao Yang, Raymond W. Yeung · 2007
With respect to a given set of local encoding kernels defining a linear network code, refined versions of the Hamming bound, the Singleton bound and the Gilbert-Varshamov bound for network error correction are proved by the weight properties of network codes. This refined Singleton bound is also proved to be tight for linear message sets.