Title :
Rank codes using weak self-orthogonal bases
Author :
Sysoev, Igor Y. ; Gabidulin, Ernst M.
Author_Institution :
Nat. Res. Univ. MIPT, Moscow, Russia
Abstract :
Finding a syndrome is the significant part of decoding rank codes procedure. Using a weak self-orthogonal basis one can decrease its complexity. In this case the major part of complexity evaluation is approximated by N(log N)2. It is less than the complexity when using Karatsuba-Ofman algorithm only.
Keywords :
Galois fields; decoding; rank codes; weak self-orthogonal bases; Algorithm design and analysis; Complexity theory; Decoding; Delay; Encoding; Power demand; Region 8;
Conference_Titel :
Computational Technologies in Electrical and Electronics Engineering (SIBIRCON), 2010 IEEE Region 8 International Conference on
Conference_Location :
Listvyanka
Print_ISBN :
978-1-4244-7625-1
DOI :
10.1109/SIBIRCON.2010.5555316
