Fast encoding and decoding of Gabidulin codes

Authors:
Danilo Silva;Frank R. Kschischang
Affiliations:
Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada;Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 5
Cited 6

Algorithms for exponentiation in finite fields

Journal of Symbolic Computation
Modern Computer Algebra

Modern Computer Algebra
A welch–berlekamp like algorithm for decoding gabidulin codes

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Coding for Errors and Erasures in Random Network Coding

IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding

IEEE Transactions on Information Theory

Subspace Codes

Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Decoding of random network codes

Problems of Information Transmission
List decoding subspace codes from insertions and deletions

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Gauss periods as constructions of low complexity normal bases

Designs, Codes and Cryptography
Fast decoding of Gabidulin codes

Designs, Codes and Cryptography
Information security in a random network coding network

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

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.