Combining subspace codes with classical linear error-correcting codes
Information Theory
2014-07-31 v2 math.IT
Abstract
We discuss how subspace codes can be used to simultaneously correct errors and erasures when the network performs random linear network coding and the edges are noisy channels. This is done by combining the subspace code with a classical linear error-correcting code. The classical code then takes care of the errors and the subspace codes takes care of the erasures.
Keywords
Cite
@article{arxiv.1407.6560,
title = {Combining subspace codes with classical linear error-correcting codes},
author = {Olav Geil and Louise Foshammer and Malte Neve-Græsbøll},
journal= {arXiv preprint arXiv:1407.6560},
year = {2014}
}
Comments
6 pages. The below paper was written in May 2014. The authors have come to know that there is a significant overlap with previous results by Vitaly Skachek, Olgica Milenkovic, and Angelia Nedic published in July 2011 as arXiv:1107.4581. Their paper entitled "Hybrid Noncoherent Network Coding" appeared in IEEE Transactions on Information Theory, June 2013