Interleaved subspace codes in fountain mode
Vladimir R. Sidorenko, Hannes Bartz, Antonia Wachter-Zeh · 2017
We consider subspace codes obtained by lifting L-interleaved [n, k] Gabidulin codes. When used in networks with random linear coding, these codes are able to correct with high probability γ packet insertions and δ packet deletions provided that γ/L + δ ≤ n - k. We propose to use these subspace codes in the so called fountain mode. In this case we do not need to correct deletions and are able to correct with high probability a large number L(n - k) of packet insertions. We present a simplified decoder correcting insertions only.