Correcting generalized matrix erasures with applications to random network coding

Conference: SCC'10 - 8th International ITG Conference on Source and Channel Coding
01/18/2010 - 01/21/2010 at Siegen, Germany

Proceedings: SCC'10

Pages: 7Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Authors:
Gabidulin, Ernst M.; Pilipchuk, Nina I. (Moscow Institute of Physics and Technology(State University), Russia)
Bossert, Martin (Institute of Telecommunications and Applied Information Theory, Ulm University, Germany)

Abstract:
Rank-metric codes are widely used in communications and recently in random network coding. In this paper generalized matrix erasures are defined and an algorithm to correct them is described. However, the main result is that we show that for the common channel model in random network coding only erasures, and no random errors have to be corrected.