New Communication Models and Decoding of Maximum Rank Distance Codes
Wrya K. Kadir
TL;DR
This paper introduces an interpolation-based decoding algorithm for Gabidulin codes that can correct more errors than traditional methods, and improves existing algorithms for twisted variants, enhancing decoding capabilities in restricted channels.
Contribution
It presents a novel interpolation-based decoding algorithm for Gabidulin codes and improves decoding algorithms for twisted Gabidulin codes, enabling correction of more errors.
Findings
Decodes rank errors beyond half the minimum distance by one unit.
Improves existing decoding algorithms for twisted Gabidulin codes.
Enhances decoding performance in restricted channel conditions.
Abstract
In this paper an interpolation-based decoding algorithm to decode Gabidulin codes, transmitted through a finely restricted channel, is proposed. The algorithm is able to decode rank errors beyond half the minimum distance by one unit. Also the existing decoding algorithms for generalized twisted Gabidulin codes and additive generalized twisted Gabidulin codes are improved.
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.