This article is cited in 19 papers

Coding Theory

Decoding of random network codes

E. M. Gabidulin^a, N. I. Pilipchuk^a, M. Bossert<sup>b

a</sup> Moscow Institute of Physics and Technology
^b Ulm University, Germany

Abstract: We consider the decoding for Silva–Kschischang–Kötter random network codes based on Gabidulin's rank-metric codes. The model of a random network coding channel can be reduced to transmitting matrices of a rank code through a channel introducing three types of additive errors. The first type is called random rank errors. To describe other types, the notions of generalized row erasures and generalized column erasures are introduced. An algorithm for simultaneous correction of rank errors and generalized erasures is presented. An example is given.

UDC: 621.391.15

Received: 14.05.2010
Revised: 27.09.2010

 English version: Problems of Information Transmission, 2010, 46:4, 300–320

Bibliographic databases:

• 
• 
•