Error and erasure control via rank-metric codes in random network coding

Error and erasure control of random network coding has recently received a lot of attention due to its solution can increase robustness and reliability of data transmission. To achieve this, additional overhead is needed for error correction. In this paper, we design an efficient and secure correcting scheme to solve this problem. This scheme reduces the computation overhead dramatically by employing efficient algorithm to detect and delete linearly dependent received packets in destination node. Meanwhile, it can simultaneously correct α + z − β row erasures and z pollution packets provided that 2τ + α + β < d. Finally, security and performance analysis validate our theory.