2000 character limit reached
Constructions of optimal rank-metric codes from automorphisms of rational function fields (1907.05508v4)
Published 11 Jul 2019 in cs.IT and math.IT
Abstract: We define a class of automorphisms of rational function fields of finite characteristic and employ these to construct different types of optimal linear rank-metric codes. The first construction is of generalized Gabidulin codes over rational function fields. Reducing these codes over finite fields, we obtain maximum rank distance (MRD) codes which are not equivalent to generalized twisted Gabidulin codes. We also construct optimal Ferrers diagram rank-metric codes which settles further a conjecture by Etzion and Silberstein.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
