A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
In this paper, we study the error correction capability of random linear network error correction codes  . We derive bounds on the probability mass function of the minimum distance of a random network error correction code and the field size required for the existence of a network error correction code with a given degradation, which is the difference between the highest possible minimum distance in the Singleton bound and the minimum distance of the code. The main tool that we use to studydoi:10.1109/isit.2007.4557447 dblp:conf/isit/BalliYZ07 fatcat:47ftkrwv6zazjde7xzxtuyzlbq