Fast Encoding and Decoding of Gabidulin Codes
arXiv:0901.2483 · doi:10.1109/ISIT.2009.5205272
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.
5 pages, 1 figure, to be published at ISIT 2009