Antipodal two-weight rank metric codes
From MaRDI portal
Publication:6130616
Abstract: We consider the class of linear antipodal two-weight rank metric codes and discuss their properties and characterization in terms of -spreads. It is shown that the dimension of such codes is 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 48941 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 3894973 (Why is no real title available?)
- A coding theory construction of new systematic authentication codes
- A geometric approach to rank metric codes and a classification of constant weight codes
- A new family of linear maximum rank distance codes
- Bilinear forms over a finite field, with applications to coding theory
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Foundations of translation planes
- Handbook of finite translation planes
- Linear cutting blocking sets and minimal codes in the rank metric
- Secret Sharing Schemes from Two-Weight Codes
- Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
- The Geometry of Two-Weight Codes
- The classification of antipodal two-weight linear codes
- The geometric field of linearity of linear sets
- Theory of codes with maximum rank distance
This page was built for publication: Antipodal two-weight rank metric codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6130616)