2000 character limit reached
Reed-Solomon-Gabidulin Codes
Published 21 Dec 2018 in cs.IT, math.IT, and math.RA | (1812.09147v2)
Abstract: We introduce Reed-Solomon-Gabidulin codes which is, at the same time, an extension to Reed-Solomon codes on the one hand and Gabidulin codes on the other hand. We prove that our codes have good properties with respect to the minimal distance and design an efficient decoding algorithm.
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.
