A decoding algorithm for Twisted Gabidulin codes

TL;DR

This paper introduces a modified decoding algorithm tailored for twisted Gabidulin codes, extending existing methods to handle cases where codes are linear over the base field but not over the extension field.

Contribution

It presents a novel decoding algorithm specifically designed for twisted Gabidulin codes, expanding decoding capabilities beyond previous limitations.

Findings

Decoding algorithm successfully applied to twisted Gabidulin codes

Handles cases where codes are linear over the base field but not over the extension field

Extends the applicability of subspace code decoding methods

Abstract

In this work, we modify the decoding algorithm for subspace codes by Koetter and Kschischang to get a decoding algorithm for (generalized) twisted Gabidulin codes. The decoding algorithm we present applies to cases where the code is linear over the base field $\mathbb{F}_q$ but not linear over $\mathbb{F}_{q^n}$.