2000 character limit reached
A decoding algorithm for Twisted Gabidulin codes (1705.07668v1)
Published 22 May 2017 in cs.IT and math.IT
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}{qn}$.