|
Problemy Peredachi Informatsii, 2010, Volume 46, Issue 4, Pages 33–55
(Mi ppi2025)
|
|
|
|
This article is cited in 18 scientific papers (total in 18 papers)
Coding Theory
Decoding of random network codes
E. M. Gabidulina, N. I. Pilipchuka, M. Bossertb a 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.
Received: 14.05.2010 Revised: 27.09.2010
Citation:
E. M. Gabidulin, N. I. Pilipchuk, M. Bossert, “Decoding of random network codes”, Probl. Peredachi Inf., 46:4 (2010), 33–55; Problems Inform. Transmission, 46:4 (2010), 300–320
Linking options:
https://www.mathnet.ru/eng/ppi2025 https://www.mathnet.ru/eng/ppi/v46/i4/p33
|
Statistics & downloads: |
Abstract page: | 690 | Full-text PDF : | 188 | References: | 59 | First page: | 18 |
|