Fast encoding and decoding of Gabidulin codes
- 1 June 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 2858-2862
- https://doi.org/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.Keywords
All Related Versions
This publication has 3 references indexed in Scilit:
- A Rank-Metric Approach to Error Control in Random Network CodingIEEE Transactions on Information Theory, 2008
- Coding for Errors and Erasures in Random Network CodingIEEE Transactions on Information Theory, 2008
- Complexity of decoding Gabidulin codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008