Analysis of network error correction based on network coding

For network error-correcting codes based on network coding an explicit lower bound on the size of source alphabet is presented. This bound is deduced by a Gilbert-Varshamov greedy algorithm. The difficulty of constructing good error-correcting codes for networks is considered and ways of constructing good codes for small-scale networks are dealt with in detail.