A Decoding Algorithm for Rank Metric Codes
Tovohery Hajatiana Randrianarisoa
TL;DR
This paper introduces a novel decoding algorithm for Gabidulin codes based on Dickson matrices and a Berlekamp-Massey-like approach, which can be adapted for twisted Gabidulin codes, advancing rank metric code decoding methods.
Contribution
It presents a new decoding algorithm for Gabidulin codes utilizing Dickson matrices and can be extended to twisted Gabidulin codes, offering an alternative to existing methods.
Findings
The new algorithm uses properties of Dickson matrices.
It employs a Berlekamp-Massey-like decoding process.
It can be adapted for twisted Gabidulin codes.
Abstract
In this work we will present algorithms for decoding rank metric codes. First we will look at a new decoding algorithm for Gabidulin codes using the property of Dickson matrices corresponding to linearized polynomials. We will be using a Berlekamp-Massey-like algorithm in the process. We will show the difference between our and existing algorithms. Apart from being a new algorithm, it is also interesting that it can be modified to get a decoding algorithm for general twisted Gabidulin codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Advanced Wireless Network Optimization · Advanced Wireless Communication Techniques