Fast Encoding and Decoding of Gabidulin Codes
Information Theory
2019-05-07 v2 math.IT
Abstract
Gabidulin codes are the rank-metric analogs of Reed-Solomon codes and have a major role in practical error control for network coding. This paper presents new encoding and decoding algorithms for Gabidulin codes based on low-complexity normal bases. In addition, a new decoding algorithm is proposed based on a transform-domain approach. Together, these represent the fastest known algorithms for encoding and decoding Gabidulin codes.
Cite
@article{arxiv.0901.2483,
title = {Fast Encoding and Decoding of Gabidulin Codes},
author = {Danilo Silva and Frank R. Kschischang},
journal= {arXiv preprint arXiv:0901.2483},
year = {2019}
}
Comments
5 pages, 1 figure, to be published at ISIT 2009