A Fast Linearized Euclidean Algorithm for Decoding
Gabidulin Codesde
A Fast Linearized Euclidean Algorithm for Decoding Gabidulin Codes

Titel:: A Fast Linearized Euclidean Algorithm for Decoding Gabidulin Codesde A Fast Linearized Euclidean Algorithm for Decoding Gabidulin Codes
Dokumenttyp:: Konferenzbeitrag
Autor(en):: Wachter, A.; Sidorenko, V.; Bossert, M.
Abstract:: We present a fast equivalent of the Extended Euclidean Algorithm for linearized polynomials (LEEA). Linearized polynomials are used to define rank metric codes, e.g. Gabidulin codes. The proposed fast LEEA accelerates decoding of Gabidulin codes since it solves the key equation with sub-quadratic complexity. In addition, we give a fast algorithm for calculating the symbolic product.
Kongress- / Buchtitel:: Int. Workshop Alg. Combin. Coding Theory (ACCT)
Jahr:: 2010
Monat:: Sep
Seiten:: 298--303
BibTeX

Vorkommen: