Compressed error and erasure correcting codes via rank-metric codes in random network coding.

SUMMARY The error control of random network coding has recently received a lot of attention because 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 a compressed error and erasure correcting scheme to decrease the additional overhead of error correction. This scheme reduces the computation overhead dramatically by employing an efficient algorithm to detect and delete linearly dependent received packets in the destination node. It also simplifies the hardware operations when the scheme reduces the received matrix Y to form E _k( Y ) instead of E( Y ) in the decoding process. If at most r original packets get combined in k packets of one batch, the payload of one packet can increase from M − k to M − O( rlog _q k) for the application of compressed code, where M is the packet length. In particular, the decoding complexity of compressed code is O( rm) operations in an extension field [ABSTRACT FROM AUTHOR]