Rank weights for arbitrary finite field extensions (Q825922)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Rank weights for arbitrary finite field extensions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rank weights for arbitrary finite field extensions |
scientific article |
Statements
Rank weights for arbitrary finite field extensions (English)
0 references
18 December 2021
0 references
The authors study various definitions of generalized rank weights for arbitrary finite extensions of fields, proving that they coincide. Specifically, they show that if \(L/k\) is a finite field extension of degree \(m\) and \(C\) is a linear code in \(L^n\), then if \(m \ge n\), there exists \(\mathbf{c} \in C\) with \(\mathrm{Rsupp}(C)=\mathrm{Rsupp}(\mathbf{c})\), where Rsupp indicates the rank support.
0 references
coding theory
0 references
network coding
0 references
rank metric codes
0 references
generalized rank weights
0 references
rank supports
0 references
Weil restriction
0 references
0 references
0.8893905
0 references
0 references
0.85510623
0 references
0 references
0.85123503
0 references
0.8506342
0 references
0.84846425
0 references
0.8477781
0 references
0 references
0.8467751
0 references