Decoding Interleaved Gabidulin Codes by Module Minimization

• Applicant: Professor Dr.-Ing. Martin Bossert
• Subject Area: Electronic Semiconductors, Components and Circuits, Integrated Systems, Sensor Technology, Theoretical Electrical Engineering
• Term: from 2014 to 2023
• Project identifier: Deutsche Forschungsgemeinschaft (DFG) - Project number 261867389

Recently it was shown that Reed-Solomon codes can be efficiently decoded using the method of module minimization. In this project we suggest to use module minimization for decoding interleaved Gabidulin codes. To do this we should find algorithms which solve the module minimization problem for modules over non commutative rings of skew polynomials. This generalization is a non trivial task because of the non commutativity of the ring. Our goals are to get low complexity algorithms for decoding interleaved Gabidulin codes in rank metric far beyond half the minimum distance. These algorithms can be immediately applied for random network coding, distributive storage, and cryptography.

• DFG Programme: Research Grants