2000 character limit reached
List-Decoding Gabidulin Codes via Interpolation and the Euclidean Algorithm
Published 23 Apr 2014 in cs.IT and math.IT | (1404.5716v1)
Abstract: We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal basis for this module using the Euclidean algorithm with respect to composition of polynomials. For a given received word, our decoding algorithm computes a list of all codewords that are closest to the received word with respect to the rank metric.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
