The network coding allows each node in a network to process information. Even if intermediate nodes simply perform linear operations over some finite field, the resulting network codes can be information-theoretically rate-optimal for a large class of communication problems.We start with a short introduction to linear network coding and show that this approach is very sensitive to errors during transmission. For error control we consider subspace codes obtained by lifting interleaved Gabidulin codes. We show that these codes are able to correct with high probability many packet insertions and deletions.      «

The network coding allows each node in a network to process information. Even if intermediate nodes simply perform linear operations over some finite field, the resulting network codes can be information-theoretically rate-optimal for a large class of communication problems.We start with a short introduction to linear network coding and show that this approach is very sensitive to errors during transmission. For error control we consider subspace codes obtained by lifting interleaved Gabidulin...     »