Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Complexity of decoding Gabidulin codes
By: Gadouleau, M.; Zhiyuan Yan;
2008 / IEEE / 978-1-4244-2246-3
This item was taken from the IEEE Conference ' Complexity of decoding Gabidulin codes ' In this paper, we analyze the complexity of decoding Gabidulin codes using the analogs in rank metric codes of the extended Euclidean algorithm or the Berlekamp-Massey algorithm. We show that a subclass of Gabidulin codes reduces the complexity and the memory requirements of the decoding algorithm. We also simplify an existing algorithm for finding roots of linearized polynomials for decoding Gabidulin codes. Finally we analyze and compare the asymptotic complexities of different decoding algorithms for Gabidulin codes.
Rank Metric Codes
Extended Euclidean Algorithm
Algorithm Design And Analysis
Error Correction Codes
Public Key Cryptography