Decoding of random network codes

Authors:
E. M. Gabidulin;N. I. Pilipchuk;M. Bossert
Affiliations:
Moscow Institute of Physics and Technology (State University), Moscow, Russia;Moscow Institute of Physics and Technology (State University), Moscow, Russia;Ulm University, Ulm, Germany
Venue:
Problems of Information Transmission
Year:
2010

Citing 5
Cited 2

A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes

Proceedings of the First French-Soviet Workshop on Algebraic Coding
Error and erasure correcting algorithms for rank codes

Designs, Codes and Cryptography
Fast encoding and decoding of Gabidulin codes

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
A welch–berlekamp like algorithm for decoding gabidulin codes

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
A Rank-Metric Approach to Error Control in Random Network Coding

IEEE Transactions on Information Theory

Rank subcodes in multicomponent network coding

Problems of Information Transmission
Information security in a random network coding network

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

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.