Abstract:We consider the notion of a (q, m)-polymatroid, due to Shiromoto, and the more general notion of (q, m)-demi-polymatroid, and show how generalized weights can be defined for them. Further, we establish a duality for these weights analogous to Wei duality for generalized Hamming weights of linear codes. The corresponding results of Ravagnani for Delsarte rank metric codes, and Martínez-Peñas and Matsumoto for relative generalized rank weights are derived as a consequence.
“…While F q m -linear rank-metric codes give rise to q-matroids, this is not the case for general rankmetric codes. However, as shown by Gorla and co-authors in [12] as well as Shiromoto [19] and Ghorpade/Johnson [9], general rank-metric codes induce q-polymatroids. This means that the rank function attains rational values (for this reason polymatroids are also referred to as fractional matroids).…”
Section: Introductionmentioning
confidence: 88%
“…Then τ (V ) ∈ N 0 for all V ∈ V(F n ) and the map τ satisfies (R2) and (R3) from Definition 2.1 as well as τ (V ) ≤ µ dim(V ). Thus M ′ := (F n , τ ) is a (q, µ)-polymatroid in the sense of [9,Def. 1].…”
Section: Deletions and Contractionsmentioning
confidence: 99%
“…1]. In [9,Def. 10] the authors define the i-th generalized weight of M ′ as d i (M ′ ) = min{dim X | τ (F n ) − τ (X ⊥ ) ≥ i}.…”
Section: Deletions and Contractionsmentioning
confidence: 99%
“…In this paper we will make further contributions to the theory of q-polymatroids. Different from [12,9,19] we will study q-polymatroids over general n-dimensional F-vector spaces E rather than F n . This forces us to revisit a duality result from [12] and show that the equivalence class of the dual q-polymatroid does not depends on the choice of the non-degenerate symmetric bilinear form on E. The purpose of this slight generalization becomes clear only when we study deletions and contractions as the latter naturally lead to general ground spaces.…”
It is well known that linear rank-metric codes give rise to q-polymatroids. Analogously to classical matroid theory one may ask whether a given q-polymatroid is representable by a rank-metric code. We provide a partial answer by presenting examples of q-matroids that are not representable by F q m -linear rank-metric codes. We then go on and introduce deletion and contraction for q-polymatroids and show that they are mutually dual and that they correspond to puncturing and shortening of rank-metric codes. Finally, we introduce a closure operator along with the notion of flats and show that the generalized rank weights of a rank-metric code are fully determined by the flats of the associated q-polymatroid.
“…While F q m -linear rank-metric codes give rise to q-matroids, this is not the case for general rankmetric codes. However, as shown by Gorla and co-authors in [12] as well as Shiromoto [19] and Ghorpade/Johnson [9], general rank-metric codes induce q-polymatroids. This means that the rank function attains rational values (for this reason polymatroids are also referred to as fractional matroids).…”
Section: Introductionmentioning
confidence: 88%
“…Then τ (V ) ∈ N 0 for all V ∈ V(F n ) and the map τ satisfies (R2) and (R3) from Definition 2.1 as well as τ (V ) ≤ µ dim(V ). Thus M ′ := (F n , τ ) is a (q, µ)-polymatroid in the sense of [9,Def. 1].…”
Section: Deletions and Contractionsmentioning
confidence: 99%
“…1]. In [9,Def. 10] the authors define the i-th generalized weight of M ′ as d i (M ′ ) = min{dim X | τ (F n ) − τ (X ⊥ ) ≥ i}.…”
Section: Deletions and Contractionsmentioning
confidence: 99%
“…In this paper we will make further contributions to the theory of q-polymatroids. Different from [12,9,19] we will study q-polymatroids over general n-dimensional F-vector spaces E rather than F n . This forces us to revisit a duality result from [12] and show that the equivalence class of the dual q-polymatroid does not depends on the choice of the non-degenerate symmetric bilinear form on E. The purpose of this slight generalization becomes clear only when we study deletions and contractions as the latter naturally lead to general ground spaces.…”
It is well known that linear rank-metric codes give rise to q-polymatroids. Analogously to classical matroid theory one may ask whether a given q-polymatroid is representable by a rank-metric code. We provide a partial answer by presenting examples of q-matroids that are not representable by F q m -linear rank-metric codes. We then go on and introduce deletion and contraction for q-polymatroids and show that they are mutually dual and that they correspond to puncturing and shortening of rank-metric codes. Finally, we introduce a closure operator along with the notion of flats and show that the generalized rank weights of a rank-metric code are fully determined by the flats of the associated q-polymatroid.
“…Thanks to their relation to rank-metric codes, q-matroids and q-polymatroids have recently garnered a lot of attention, [1,2,3,4,5,6,7,10]. Indeed, F q m -linear rank-metric codes in F n q m give rise to qmatroids, whereas F q -linear rank-metric codes induce q-polymatroids.…”
This paper is devoted to the study of independent spaces of q-polymatroids. With the aid of an auxiliary q-matroid it is shown that the collection of independent spaces satisfies the same properties as for q-matroids. However, in contrast to q-matroids, the rank value of an independent space does not agree with its dimension. Nonetheless, the rank values of the independent spaces fully determine the q-polymatroid, and this fact can be exploited to derive a cryptomorphism of q-polymatroids. Finally, the notions of minimal spanning spaces, maximally strongly independent spaces, and bases will be elaborated on.
Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated q-system. Using this result, we provide the first construction of a family of $$\mathbb F_{q^m}$$
F
q
m
-linear MRD codes of length 2m that are not obtained as a direct sum of two smaller MRD codes. In addition, such a family has better parameters, since its codes possess generalized rank weights strictly larger than those of the previously known MRD codes. This shows that not all the MRD codes have the same generalized rank weights, in contrast to what happens in the Hamming metric setting.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.