|| On the decoding of the sum of Gabidulin codes
||Pierre Loidreau, Ba Duc Pham, University of Rennes 1, France|
||D1-S3-T2: Rank-Metric Codes II
||Monday, 12 July, 22:40 - 23:00
||Monday, 12 July, 23:00 - 23:20
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.