On the decoding of the sum of Gabidulin codes

We investigate the decoding of the sum of Gabidulin codes. We show that there exists a probabilistic polynomial-time decoder up to some bound. We then give some potential applications of constructing and decoding a sum of Gabidulin codes. This approach can lead to a new insight in designing rank-metric based cryptographic schemes.