On fast decoding of interleaved Gabidulin codes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

The paper is dedicated to Ernst M. Gabidulin on his 75th anniversary Abstract-Interleaving or the direct sum of L Gabidulin codes with rank distance d can be applied for random network coding. For the codes over Fqm a fast decoding algorithm is proposed correcting with high probability errors of rank up to L/L+1(d-1). The algorithm is based on fast skew-feedback shift-register synthesis and for fixed L has time complexity O(m 3logm) operations in the base field Fq.

Original languageEnglish
Title of host publicationProceedings - 2012 13th International Symposium on Problems of Redundancy in Information and Control Systems, RED 2012
Pages78-83
Number of pages6
DOIs
StatePublished - 2012
Externally publishedYes
Event2012 13th International Symposium on Problems of Redundancy in Information and Control Systems, RED 2012 - St. Petersburg, Russian Federation
Duration: 5 Sep 201210 Sep 2012

Publication series

NameProceedings - 2012 13th International Symposium on Problems of Redundancy in Information and Control Systems, RED 2012

Conference

Conference2012 13th International Symposium on Problems of Redundancy in Information and Control Systems, RED 2012
Country/TerritoryRussian Federation
CitySt. Petersburg
Period5/09/1210/09/12

Fingerprint

Dive into the research topics of 'On fast decoding of interleaved Gabidulin codes'. Together they form a unique fingerprint.

Cite this