A module minimization approach to Gabidulin decoding via interpolation
Journal of Algebra Combinatorics Discrete Structures and Applications · 2018-01-15 · 5 (1) · 29-43
DOI: 10.13069/jacodesmath.369863 ↗At a glance
Journal article in Journal of Algebra Combinatorics Discrete Structures and Applications, published online on 2018-01-15. Written by Anna-Lena Horlemann-Trautmann and 1 co-authors. Cited 2 times so far (Crossref). The full text is freely available (open access, CC BY 4.0).
Abstract (original language)
We focus on iterative interpolation-based decoding of Gabidulin codes and present an algorithm that computes a minimal basis for an interpolation module. We extend existing results for Reed-Solomon codes in showing that this minimal basis gives rise to a parametrization of elements in the module that lead to all Gabidulin decoding solutions that are at a fixed distance from the received word. Our module-theoretic approach strengthens the link between Gabidulin decoding and Reed-Solomon decoding, thus providing a basis for further work into Gabidulin list decoding.
Cite
APA
Horlemann-Trautmann, A., & Kuijper, M. (2018). A module minimization approach to Gabidulin decoding via interpolation. Journal of Algebra Combinatorics Discrete Structures and Applications, 5(1), 29-43. https://doi.org/10.13069/jacodesmath.369863
Vancouver
Horlemann-Trautmann A, Kuijper M. A module minimization approach to Gabidulin decoding via interpolation. Journal of Algebra Combinatorics Discrete Structures and Applications. 2018;5(1):29-43. doi:10.13069/jacodesmath.369863
BibTeX
@article{HorlemannTrautmann2018,
author = {Horlemann-Trautmann, Anna-Lena and Kuijper, Margreta},
title = {A module minimization approach to Gabidulin decoding via interpolation},
journal = {Journal of Algebra Combinatorics Discrete Structures and Applications},
year = {2018},
volume = {5},
number = {1},
pages = {29--43},
doi = {10.13069/jacodesmath.369863}
}
EUVIMED