Rank codes using weak self-orthogonal bases

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)
²
. It is less than the complexity when using Karatsuba-Ofman algorithm only.