Improved decoding of symmetric rank metric errors

We consider the decoding of rank metric codes assuming the error matrix is symmetric. We prove two results. First, for rates $1/2$, we propose a decoder for Gabidulin codes correcting symmetric errors of rank up to $n-k$. The two mentioned decoders are deterministic and worst case.