  This work compares the performance of software implementations of different
Gabidulin decoders. The parameter sets used within the comparison stem from
their applications in recently proposed cryptographic schemes. The complexity
analysis of the decoders is recalled, counting the occurrence of each operation
within the respective decoders. It is shown that knowing the number of
operations may be misleading when comparing different algorithms as the
run-time of the implementation depends on the instruction set of the device on
which the algorithm is executed.
