2000 character limit reached
Antipodal two-weight rank metric codes
Published 15 Aug 2022 in cs.IT and math.IT | (2208.07295v2)
Abstract: We consider the class of linear antipodal two-weight rank metric codes and discuss their properties and characterization in terms of $t$-spreads. It is shown that the dimension of such codes is $2$ and the minimum rank distance is at least half of the length. We construct antipodal two-weight rank metric codes from certain MRD codes. A complete classification of such codes is obtained, when the minimum rank distance is equal to half of the length. As a consequence of our construction of two-weight rank metric codes, we get some explicit two-weight Hamming metric codes.
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.