Rank-metric codes, linear sets, and their duality (Q2306904)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7182907
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rank-metric codes, linear sets, and their duality |
scientific article; zbMATH DE number 7182907 |
Statements
Rank-metric codes, linear sets, and their duality (English)
0 references
27 March 2020
0 references
This is a nice paper on the theory of \({\mathbb F}_{q^n}\)-linear rank-metric codes and their links with subgeometries and, in particular, linear sets in higher dimension. The main theoretical result, contained in Sections 4 and 5, is unsurprising, in the sense that it is expected that being MRD corresponds to ``have minimal intersection with some geometric objects''; the authors show that the appropriate notion in this case is ``being scattered with respect to hyperplanes'' which they introduce and discuss. This suggests also a close relationship with ordinary Hamming metric codes, as ``being scattered with respect to hyperplanes'' would there translate in a very nice upper bound on the minimum distance.
0 references
MRD code
0 references
weight distribution
0 references
linear set
0 references
scattered with respect to hyperplanes
0 references
0 references
0.8603662848472595
0 references
0.8520289063453674
0 references
0.851925253868103
0 references
0.8500307202339172
0 references
0.8393071889877319
0 references