Network Error Correction Coding in Packetized Networks

This paper, we studies basic properties of network error correction codes, their construction, and correction capability for various kinds of errors. Our discussion is confined to the single source multicast case. We define the minimum rank of a network error correction code. This plays the same role that minimum distance has played in classical coding theory. We prove the existence of codes that can correct errors up to the full error correction capability in singleton bound. Even when the rank of the error is higher than the error correction capability, we show that the error can be corrected with very high probability under reasonable assumptions