Abstract
Minimal rankmetric 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 qsystem. Using this result, we provide the first construction of a family of \(\mathbb 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.
1 Introduction
Overview Codes in the rank metric have seen a rapid increase in interest in the last decades, due to their application to network coding. However, researchers have been fascinated by these codes not only for this application, but also for their intrinsic mathematical structure. Indeed, rankmetric codes have been studied in connection with many mathematical areas, such as finite semifields, linear sets in finite geometry, tensors, qanalogues in combinatorics.
Rankmetric codes can be seen either as vector subspaces of the space of \(n \times m\) matrices over a (possibly finite) field, e.g. \({\mathbb F}_{q}\), or as subspaces of vectors of length n over a degree m extension field, e.g. \({\mathbb F}_{q^m}\). In both cases, the most important parameters of a rankmetric code are given by n, m, its dimension and its minimum rank distance, that is the minimum rank of a nonzero element of the code. These parameters are related by a very elegant inequality, which is known as the Singletonlike bound. Codes attaining this bound with equality are called maximum rank distance (MRD) codes, and they are considered to be optimal, due to their largest possible errorcorrection capability.
Constructions of MRD codes are known for every parameters if we consider \({\mathbb F}_{q}\)linear rankmetric codes. However, with the further requirement to be \({\mathbb F}_{q^m}\)linear, this is not anymore true. Indeed, constructions of \({\mathbb F}_{q^m}\)linear MRD codes are known when \(n\le m\) for any possible dimension and finite field size and they were already proposed in the seminal papers by Delsarte [7] and Gabidulin [10]. When \(n>m\), the only known constructions concern 3dimensional MRD codes with \(n=\frac{3m}{2}\), when m is even [3, 5], and the direct sum of copies of suitable MRD codes among those just described [18, Proposition 22].
As already well known for classical coding theory involving the Hamming metric, also rankmetric codes have a geometric equivalent representation. This was initially described in several works [5, 33, 37] for some special cases and was definitely established independently by Sheekey [34] and Randrianarisoa [29]. Namely, \({\mathbb F}_{q^m}\)linear codes of length n and \({\mathbb F}_{q^m}\)dimension k can be equivalently represented in a geometric way as \({\mathbb F}_{q}\)subspaces of \({\mathbb F}_{q^m}^k\) of \({\mathbb F}_{q}\)dimension n. They were named as qsystems and provide a sort of dual representation of rankmetric codes, which was shown to be useful in characterizing families of codes, as it happens for codes in the Hamming metric. Already Randrianarisoa in [29] exploited this geometric perspective to give a complete classification of \({\mathbb F}_{q^m}\)linear oneweight codes in the rank metric.
Recently, in [1], a new class of rankmetric codes has been introduced and investigated, the family of minimal rankmetric codes. The peculiarity of these codes is that the set of supportswhich in the rankmetric setting is given by \({\mathbb F}_{q}\)subspaces of \({\mathbb F}_{q}^n\)form an antichain with respect to the inclusion and they are the qanalogues of minimal linear codes in the Hamming metric, which have been shown to have interesting combinatorial and geometric properties and applications to secret sharing schemes, as proposed by Massey [24, 25]. Using the geometric viewpoint, minimal rankmetric codes have been shown in [1] to correspond to linear cutting blocking sets, which are special qsystems U with the following intersection property: for every \({\mathbb F}_{q^m}\)hyperplane H, it holds \(\langle U\cap H\rangle _{{\mathbb F}_{q^m}}=H\). Furthermore, always in [1], constructions of minimal rankmetric codes were proposed using scattered subspaces in a threedimensional \({\mathbb F}_{q^m}\)space.
Our contribution Motivated by the study of minimal rankmetric codes, we make further progresses on linear cutting blocking sets and their properties. We give a new characterization of them in terms of their evasiveness properties. In particular, in Theorem 3.3, we show that a qsystem U of \({\mathbb F}_{q^m}^k\) of \({\mathbb F}_{q}\)dimension n is a linear cutting blocking set if and only if it is \((k2,nm1)_q\)evasive. This means that every \((k2)\)dimensional \({\mathbb F}_{q^m}\)subspace of \({\mathbb F}_{q^m}^k\) intersects U in a space of \({\mathbb F}_{q}\)dimension at most \(nm1\). In a coding theoretic language, this translates in a very elegant and concise characterization described in Theorem 3.4 which can be read as follows:
Theorem 3.4 An \({\mathbb F}_{q^m}\)linear (nondegenerate) rankmetric code in \({\mathbb F}_{q^m}^n\) is minimal if and only if its second generalized rank weight is strictly greater than the field extension degree m.
This result does not seem to have an analogue in the Hamming metric, and thus, it is genuinely new.
Since every qsystem containing a linear cutting blocking set is itself a linear cutting blocking set, it is then natural to look only for the small ones; or, in other words, for the existence of short minimal rankmetric codes. In this direction, we provide the first answers for small parameters. We completely settle the case \((k,m)=(4,3)\) for every prime power q, and then, we construct a family of linear cutting blocking sets of \({\mathbb F}_{q}\)dimension 8 in \(\mathbb F_{q^4}^4\), when q is an odd power of 2. Concretely, the latter is proved in Theorem 4.5, where we show that the qsystem,
is a linear cutting blocking set of \(\mathbb F_{q^4}^4\).
As a byproduct, we also show that the codes associated with U give rise to a new family of fourdimensional MRD codes. This immediately follows from the geometric result given in Theorem 4.1, where U is proved to be scattered. We then compare these codes with the known constructions of \({\mathbb F}_{q^m}\)linear MRD codes, realizing that not only they are knew, but they are structurally new. Indeed, the codes we construct cannot be obtained as direct sum of smaller MRD codes, in contrast to all the previously known constructions. We show that this also implies that these new codes have better parameters, being their second generalized rank weight strictly larger. This is in strong contrast with what happens for the Hamming metric, in which MDS codes have all the same generalized (Hamming) weights. Thus, the new construction provides the first very concrete evidence that MRD codes can have substantially different parameters.
Outline The paper is structured as follows. Section 2 introduces the main objects and notions that we need in the paper, giving a brief recap on rankmetric codes, qsystems and their evasiveness and cutting properties. In Sect. 3, we explore the link between linear cutting blocking sets and evasive qsystems, showing that minimal rankmetric codes can be characterized in terms of their second generalized rank weight. Section 4 contains the study of the special qsystem U in (1), which is shown to be scattered and \((2,3)_q\)evasive with the aid of some technical results. After discussing the properties of the generalized rank weights of the associated MRD codes, we conclude in Sect. 5, listing some open problems and new research directions.
2 Preliminaries
In this section, we recall the basic notions on qsystems, evasive subspaces, linear cutting blocking sets and their relations with linear rankmetric codes. We first introduce the setting. Let q be a prime power and let k, n, m be positive integers. We denote by \({\mathbb F}_{q}\) the finite field with q element and by \({\mathbb F}_{q^m}\) the extension field of degree m. Furthermore, for any positive integer r, \(V(r,q^m)\) is a vector space of dimension r over \({\mathbb F}_{q^m}\). This will be always identified with \({\mathbb F}_{q^m}^r\). Also, any onedimensional \({\mathbb F}_{q^m}\)vector subspace of V will be called point of V.
2.1 Rankmetric codes
Rankmetric codes were originally introduced by Delsarte in the late 70’s in [7], for a pure mathematical interest and with no applications in mind. They were reintroduced a few years later by Gabidulin in [10] and later several applications of codes in the rankmetric were proposed, such as crisscross correction [32], cryptography [11], distributed storage [31] and network coding [35]. Mathematically speaking, one can either define them as set of matrices over a (finite) field, or as set of vectors defined over an extension field. In this work, we will only consider the vector representation, and in particular, we will focus on rankmetric codes which are linear over the extension field.
On the vector space \(V(n,q^m)\), we fix the metric induced by the \({\mathbb F}_{q}\)rank. More precisely, the rank weight is defined, for \(v=(v_1,\ldots ,v_n)\in V(n,q^m)\), as
If \(\mathrm{wt}_{\mathrm{rk}}(v)=r\) and we fix an \({\mathbb F}_{q}\)basis \(u=(u_1,\ldots,u_r)\) of \(\langle v_1,\ldots,v_n\rangle_{{\mathbb F}_{q}}\), then there exists a matrix \(A\in {\mathbb F}_{q}^{r\times n}\) such that \(v=uA\). The rank support of \(v\) defined as \(\mathrm{supp}(v):=\mathrm{rowsp}(A)\subseteq {\mathbb F}_{q}^n,\) where \(\mathrm{rowsp}(A)\) denotes the \({\mathbb F}_{q}\) span of the rows of \(A\), and it is welldefined since it does not depend on the choice of \(u\). The rank weight induces a metric, which is given by the rank distance, defined for \(u,v \in V(n,q^m)\) as \({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}}}(u,v)=\mathrm {wt}_{{{\,\mathrm{rk}\,}}}(uv)\).
Definition 2.1
An \([n,k]_{q^m/q}\) (rankmetric) code is a kdimensional \({\mathbb F}_{q^m}\)subspace of \(V(n,q^m)\) endowed with the rank distance.
Before introducing the metric properties and invariants of a rankmetric code, we introduce the notion of minimality of codewords and of codes; see also 1.
Definition 2.2
Let \({\mathcal {C}}\) be an \([n,k]_{q^m/q}\) code. A nonzero codeword \(v\in{\mathcal C}\) is minimal if for every \(u \in {\mathcal C}\), \(\mathrm{supp}(u)\subseteq \mathrm{supp}(v) \Longleftrightarrow u=\lambda v, \mbox{ for some } \lambda \in {\mathbb{F}_{q^m}}\). Furthermore, if every nonzero codeword of \({\mathcal {C}}\) is minimal, then \({\mathcal {C}}\) is said to be a minimal rankmetric code.
Important invariants of rankmetric codes are given by their generalized rank weights. They have been first introduced and studied by Kurihara et al. in [16, 17], by Oggier and Sboui in [26] and by Ducoat and Kyureghyan in [8]. They are the analogue of generalized weights in Hamming metric and are of great interest due to their combinatorial properties (see [12, 15, 30]) and their applications to network coding (see [22, 23]).
Let \(\mathcal A\subseteq V(n,q^m)\) and \(\theta \in \mathrm {Gal}({\mathbb F}_{q^m}/{\mathbb F}_{q})\), and denote by \(\theta (\mathcal A)\) the image of \(\mathcal A\) under the componentwise map \(\theta\), that is
We say that \(\mathcal A\) is Galois closed if \(\theta (\mathcal A)=\mathcal A\) for every \(\theta \in \mathrm {Gal}({\mathbb F}_{q^m}/{\mathbb F}_{q})\). Observe that this is equivalent to require that \(\theta (\mathcal A)=\mathcal A\) for a generator of \(\mathrm {Gal}({\mathbb F}_{q^m}/{\mathbb F}_{q})\). For instance, we can just consider \(\theta\) to be the qFrobenius automorphism. We denote by \(\Lambda _q(n,m)\) the set of Galois closed \({\mathbb F}_{q^m}\)subspaces of \(V(n,q^m)\).
Definition 2.3
Let \(\mathcal C\) be an \([n,k]_{q^m/q}\) code, and let \(1\le j \le k\). The jth generalized rank weight of \(\mathcal C\) is the integer
For brevity, when we want to underline the generalized rank weights of \(\mathcal C\), we will call it an \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) code, where \(d_i:={{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},i}(\mathcal C)\).
Observe that the first generalize weight coincides with the minimum rank distance of \(\mathcal C\), that is
When only the minimum rank distance is relevant, we will write that \(\mathcal C\) is an \([n,k,d]_{q^m/q}\) code.
The minimum rank distance of a code measures its error correction capability, and hence, it is a fundamental parameter and it is crucial to have it as large as possible. However, there are some constraints on the parameters that one has to take into account. The most important one is given by the wellknown Singleton bound.
Theorem 2.4
(Singleton Bound [7]) Let \(\mathcal C\) be an \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) code. Then,
A code \(\mathcal C\) is said to be maximum rank distance (MRD) if Bound (2) is met with equality.
The first construction of \([n,k]_{q^m/q}\) MRD codes was provided already by Delsarte [7] and Gabidulin [10], when \(n\le m\). These codes are known today as DelsarteGabidulin codes. When \(n\le m\), another construction was also provided more recently by Sheekey in [33]. Additional constructions can be obtained when \(n=tm\) and \(k=tk'\) via the direct sum of t copies of an \([m,k',mk'+1]_{q^m/q}\) MRD code, e.g. a DelsarteGabidulin code. These constructions have been recently extended using geometric arguments in [3, 5], for k odd, \(m=2m'\) and \(n=m'k\), giving \([km',k,m1]_{q^m/q}\) MRD codes. They are obtained as direct sum of \([m,2,m1]_{q^m/q}\) MRD codes (like DelsarteGabidulin codes) and \([3m',3,m1]_{q^m/q}\) MRD codes. In particular, these are the only constructions of \([n,k,d]_{q^m/q}\) MRD codes with \(n>m\).
Also, the generalized rank weights are important for applications and give a measure on the security performance and the error correction capability of secure network coding; see [16]. As for the minimum rank distance, one can derive bounds on the parameters of a code involving the generalized rank weights. In this case, the bounds are more complicated.
Proposition 2.5
(Bounds [22]) Let \(\mathcal C\) be an \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) code. Then, for each \(s \in \{1,\ldots ,k\}\), we have
Apart from the bounds, the most important properties of the generalized rank weights are given by the strict monotonicity and the Weitype duality. The latter involves the notion of dual code. If \(\mathcal C\) is an \([n,k]_{q^m/q}\) code, we define \(\mathcal C^\perp\) to be its orthogonal complement with respect to the standard inner product on \(V(n,q^m)\). In other words, \(\mathcal C^\perp\) is the \([n,nk]_{q^m/q}\) code given by
and it is called the dual code of \(\mathcal C\).
Proposition 2.6
(see [8, 16]) Let \(\mathcal C\) be an \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) code and let \(\mathcal C^\perp\) be its dual \([n,nk,(d_1^\perp ,\ldots ,d_{nk}^\perp )]_{q^m/q}\) code. Then,

1
\(1\le d_1<d_2<\ldots <d_k\le n\). (Monotonicity)

2
\(\{d_1, \ldots ,d_k\}\cup \{n+1d_1^\perp ,\ldots , n+1d_{nk}^\perp \}=\{1,\ldots ,n\}\). (Weitype duality)
We conclude by recalling the notions of (non)degeneracy and of equivalence of rankmetric codes. There are several equivalent ways to define nondegenerate rankmetric codes; see, e.g. [1, Proposition 3.2]. Here, we give the following.
Definition 2.7
An \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) code is said to be nondegenerate if \({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},k}(\mathcal C)=n\).
Also, concerning equivalence of codes, there are a few ways to introduce this notion. Here, we only consider equivalence of codes given by linear isometries of the ambient space \(V(n,q^m)\).
Definition 2.8
Two \([n,k]_{q^m/q}\) codes \(\mathcal C_1, \mathcal C_2\) are said to be (linearly) equivalent if there exists \(A\in \mathrm{GL}(n,q)\) such that \(\mathcal C_2=\mathcal C_1\cdot A:=\{vA \,:\, v \in \mathcal C_1\}\),
2.2 qsystems
In this section, we recall some notions and results on qsystems. They were introduced by Sheekey in [34] and by Randrianarisoa in [29], as the natural geometric objects describing \([n,k]_{q^m/q}\) codes. In particular, we will focus on evasive subspaces and linear cutting blocking sets.
We first introduce the notion of weight with respect to an \({\mathbb F}_{q}\)subspace.
Definition 2.9
Let U be an \(\mathbb F_q\)subspace of \(V(k,q^m)\). For an \({\mathbb F}_{q^m}\)subspace H of \(V(k,q^m)\), we define the weight of H in U the quantity \(\mathrm {wt}_{U}(H):=\dim _{{\mathbb F}_{q}}(H\cap U)\).
We now recall the definition of qsystem, which was given in [29] for the first time.
Definition 2.10
An \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) system U is an \({\mathbb F}_{q}\)subspace of \(V(k,q^m)\), with \(\dim _{{\mathbb F}_{q}}(U)=n\) and such that \(\langle U \rangle _{{\mathbb F}_{q^m}}=V(k,q^m)\). For each \(i \in \{1,\ldots ,k\}\), the parameter \(d_i\) is defined as
When the parameters \((d_1,\ldots ,d_k)\) are not relevant/known, we will write that U is an \([n,k]_{q^m/q}\) system. Furthermore, when none of the parameters is relevant, we will generically refer to U as a q system.
Two \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) systems \(U_1,U_2\) are (linearly) equivalent if there exists \(A\in \mathrm{GL}(k,q^m)\) such that \(U_1\cdot A:=\{uA \,:\, u \in U_1\}=U_2\).
The notation and the language used for studying qsystems are inherited from the theory of rankmetric codes. This is due to their strong interconnection that was first observed in [34], and in [29], and then further developed in [1, 21].
Let \(\mathfrak U(n,k,(d_1,\ldots ,d_k))_{q^m/q}\) denote the set of equivalence classes [U] of \([n,k,(d_1,\ldots,d_k)]_{q^m/q}\) systems, and let \(\mathfrak C(n,k,(d_1,\ldots ,d_k))_{q^m/q}\) denote the set of equivalence classes \([\mathcal C]\) of nondegenerate \([n,k,(d_1,\ldots,d_k)]_{q^m/q}\) codes. One can define the maps
Theorem 2.11
(see [29]) The maps \(\Phi\) and \(\Psi\) are well defined and they are one the inverse of each other. Hence, they define a onetoone correspondence between equivalence classes of \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) codes and equivalence classes of \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) systems.
In light of Theorem 2.11, from now on, for any \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) system U, we say that a nondegenerate \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) code \(\mathcal C\) is associated with U if \(\mathcal C\in \Psi ([U])\). Similarly, an \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) system U will be said to be associated with a nondegenerate \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) code \(\mathcal C\) if \(U\in \Phi ([\mathcal C])\).
A special family of qsystems is given by the socalled evasive subspaces, which generalize scattered subspaces.
Definition 2.12
Let h, r be positive integers such that \(h<k\). An \([n,k]_{q^m/q}\) system U is said to be an \((h,r)_q\)evasive subspace (or simply \((h,r)_q\)evasive) if \(\dim _{{\mathbb F}_{q}}(U\cap H)\le r\) for each \({\mathbb F}_{q^m}\)subspace H of \(V(k,q^m)\) with \(\dim _{{\mathbb F}_{q^m}}(H)=h\). When \(r=h\), an \((h,h)_q\)evasive subspace is called hscattered. Furthermore, when \(h=1\), a 1scattered subspace will be simply called scattered.
From [6, Theorem 2.3], if U is an hscattered of \(V(k,q^m)\), then \(\dim _{{\mathbb F}_{q}}(U)\le \frac{km}{h+1}\). When the equality is reached, then U is said be maximum.
Evasive subspaces are a special family of evasive sets, which were introduced first by Pudlák and Rödl [28]. These objects were then analysed by Guruswami [13, 14], Dvir and Lovett [9] in connection with list decodability of codes with optimal rate and constant listsize. A mathematical theory of evasive subspace was recently developed in [2].
The following result highlights the relations between evasive subspaces and the parameters of the associated rankmetric codes.
Theorem 2.13
(see [21, Theorem 3.3]) Let \(\mathcal C\) be an \([n,k]_{q^m/q}\) code, and let \(U\in \Phi ([\mathcal C])\). Then, the following are equivalent.

1
U is an \((h,r)_q\)evasive subspace.

2
\({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},kh}(\mathcal C) \ge nr\).

3
\({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},rh+1}(\mathcal C^\perp )\ge r+2\).
In particular, \({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},kh}(\mathcal C) = nr\) if and only if U is \((h,r)_q\)evasive but not \((h,r1)_q\)evasive.
We conclude this section by recalling another family of qsystems which was recently introduced in [1].
Definition 2.14
An \([n,k]_{q^m/q}\) system U is said to be t cutting if for every \({\mathbb F}_{q^m}\)subspace H of \(V(k,q^m)\) of codimension t we have \(\langle H \cap U \rangle _{\mathbb F_{q^m}} =H\). When \(t=1\), we simply say that U is cutting (or a linear cutting blocking set).
The study of these objects was due to their connection to minimal rankmetric codes, as one can see from the following result.
Theorem 2.15
(see [1, Corollary 5.7]) Let \(\mathcal C\) be an \([n,k]_{q^m/q}\) code, and let \(U\in \Phi ([\mathcal C])\) be any of the associated \([n,k]_{q^m/q}\) systems. Then, \(\mathcal C\) is a minimal rankmetric code if and only if \(U\) is a linear cutting blocking set.
The following bound on the parameters of linear cutting blocking sets is derived in [1].
Proposition 2.16
(see [1, Corollary 5.10]) Let U be a cutting \([n,k]_{q^m/q}\) system, with \(k \ge 2\). Then, \(n\ge m+k1\).
Moreover, always in [1], it was observed that linear cutting blocking sets are related with scattered subspaces when \(k=3\). In this case, scattered subspaces were used to construct linear cutting blocking sets, as the following result shows.
Proposition 2.17
(see [1, Theorem 6.3]) If U is a scattered \([n,3]_{q^{m}/q}\) system with \(n \ge m+2\), then U is cutting.
In the next section, we will further investigate the properties and the parameters of linear cutting blocking sets, and their connection with evasive subspaces. In particular, we will answer the following two natural questions: Can we generalize Proposition 2.17 to larger values of k? Does the converse of Proposition 2.17 hold? The answers are both contained in a more general result given in Theorem 3.3.
3 Linear cutting blocking sets and evasive subspaces
In this section, we derive new results on evasive subspaces and linear cutting blocking sets. In particular, our aim is to prove the main result of Theorem 3.3 which shows how these two objects are related.
3.1 Evasive subspaces
We first start with evasive subspaces, showing in which cases an \((h,r)_q\)evasive qsystem can also be \((h',r')_q\)evasive, for some special parameters \((h',r')\).
The next result is an improvement on [2, Proposition 2.6].
Proposition 3.1
Let U be an \((h,r)_q\)evasive \([n,k]_{q^m/q}\) system and let \(s<h\) be such that \(nr+s>\frac{(kh+s)m}{2}\). Then, U is \((hs,rs1)_q\)evasive.
Proof
By [2, Proposition. 2.6], the \([n,k]_{q^m/q}\) system U is \((hs+1,rs+1)_q\)evasive and \((hs,rs)_q\)evasive. Let H be an \((hs)\)dimensional \({\mathbb F}_{q^m}\)subspace of \(V(k,q^m)\) such that \(\dim_{\mathbb{F}_q} (H\cap U)=rs\). Let us consider the projection \(\pi _H:V(k,q^m)\rightarrow \Lambda\), where \(\Lambda \subseteq V(k,q^m)\) is a \((kh+s)\)dimensional \({\mathbb F}_{q^m}\)subspace with \(\Lambda \cap H=\{{0}\}\). In this way, \(\pi _H(U)\) is an \({\mathbb F}_{q}\)subspace of \(\Lambda\) of \({\mathbb F}_{q}\)dimension \(nr+s\). By the assumption on the parameters, \(\pi _H(U)\) is not scattered, hence there exists a point \(P=\langle v\rangle _{{\mathbb F}_{q^m}}\) with \(\mathrm {wt}_{\pi _{H}(U)}(P)\ge 2\). This implies that the \((hs+1)\)dimensional \({\mathbb F}_{q^m}\)subspace spanned by H and \(\pi _H^{1}(P)\) has weight at least \(rs+2\) in U, a contradiction. \(\square\)
Also, we have the following result.
Proposition 3.2
If U is an \((h,r)_q\)evasive \([n,k]_{q^m/q}\) system with \(r<hm\), then U is \((2h,r+hm1)_q\)evasive.
Proof
By way of contradiction suppose that there exists a (2h)dimensional \({\mathbb F}_{q^m}\)subspace \(H\subseteq V(k,q^m)\) with \(\mathrm {wt}_{U}(H)\ge r+hm\). Then, each point of H has weight at least 1 in U and H can be partitioned in \(q^{hm}+1\) \({\mathbb F}_{q^m}\)subspaces of dimension h. Since U is \((h,r)_q\)evasive, the maximum number of vectors of U contained in H is
which is less than \(q^{r+hm}\), a contradiction. \(\square\)
3.2 Linear cutting blocking sets
We start by generalizing the result in Proposition 2.17 to the case of arbitrary \(k \ge 3\). Furthermore, it is natural to ask whether the converse of Proposition 2.17 is true, or at least under which condition it holds. Here, we give a complete answer to this question.
Theorem 3.3
Let U be an \([n,k]_{q^m/q}\) system. Then, U is \((k2,nm1)_q\)evasive if and only if it is cutting.
Proof
(\(\Rightarrow\)) Assume by contradiction that U is not cutting. Then, there exists an \({\mathbb F}_{q^m}\)hyperplane H of \(V(k,q^m)\) such that \(\langle H\cap U\rangle _{{\mathbb F}_{q^m}}\subseteq M\), where \(\dim _{{\mathbb F}_{q^m}}(M)=k2\). In particular, we have \(M\cap U\supseteq H\cap U\), and \(\dim _{{\mathbb F}_{q}}(H\cap U)\ge \dim _{{\mathbb F}_{q}}(H)+\dim _{{\mathbb F}_{q}}(U)km=(k1)m+nkm=nm\). However, this contradicts the hypothesis that U is \((k2,nm1)_q\)evasive.
(\(\Leftarrow\)) By way of contradiction, suppose that there exists a \((k2)\)dimensional \(\mathbb F_{q^m}\)subspace, say M, of \(V(k,q^m)\) such that
Since U is cutting, each of the \(q^m+1\) hyperplanes through M has \(q^t>q^h\) vectors in U. It follows that
a contradiction. \(\square\)
From Theorem 3.3, we can actually characterize minimal rankmetric codes in terms of their second generalized rank weight. Even though it directly follows from Theorems 3.3 and 2.12, the following result will be named as a theorem, due to its importance and conciseness.
Theorem 3.4
Let \(\mathcal C\) be a nondegenerate \([n,k,(d_1,\ldots ,d_k)]_{q^m/q}\) code. Then, \(\mathcal C\) is minimal if and only if \(d_2\ge m+1\).
Observe that Theorem 3.4 generalizes the result obtained in [1, Corollary 6.19], where the same equivalence was provided only for a special set of parameters.
We know that there are some cases in which the lower bound in Proposition 2.16 is reached. Indeed, there exists a scattered \(\mathbb F_q\)subspace of \(V(3,q^5)\) of dimension 7 [2] and hence a linear cutting blocking set of \(V(3,q^5)\) of minimal dimension. However, in general, the lower bound is not met for every set of parameters.
Corollary 3.5
If \(m<(k1)^2\), then there are no cutting \([m+k1,k]_{q^m/q}\) systems.
Proof
If U is a cutting \([m+k1,k]_{q^m/q}\) system, by Theorem 3.3, U is \((k2)\)scattered and by [6, Theorem 2.3], \(\dim _{{\mathbb F}_{q}}(U)\le \frac{km}{k1}\), which contradicts our assumptions. \(\square\)
If we instead restrict to the case that m is equal to \((k1)^2\), we have that linear cutting blocking sets of dimension \(m+k1\) are equivalent to maximum \((k2)\)scattered qsystems. More precisely, we have the following.
Corollary 3.6
Let U be a \([k(k1),k]_{q^{(k1)^2}/q}\) system and let \(\mathcal C\) be a code associated with U. The following are equivalent.

1
U is maximum \((k2)\)scattered.

2
U is cutting.

3
\(\mathcal C\) is MRD.

4
\(\mathcal C\) is minimal.
We conclude by providing two inductive constructions of linear cutting blocking sets.
Proposition 3.7
Let W be a linear cutting blocking set in a hyperplane H of \(V(k+1,q^m)\) of dimension t and let \(\langle v \rangle _{{\mathbb F}_{q^m}}\) be a point not in H. Then, \(U=W+\langle v \rangle _{{\mathbb F}_{q^m}}\) is a cutting \([t+m,k+1]_{q^m/q}\) system.
Proof
Easy computations show that U is a union of lines through \(\langle v \rangle _{{\mathbb F}_{q^m}}\). Let \(\Pi\) be a hyperplane of \(V(k+1,q^m)\) different from H. Since W is cutting, \(\langle \Pi \cap H \cap W\rangle _{{\mathbb F}_{q}}=H\cap \Pi\) and there exists at least a line trough \(\langle v \rangle _{{\mathbb F}_{q^m}}\) intersecting \(\Pi\) in a point defined by a vector of \(U\setminus W\). The assertion follows. \(\square\)
Proposition 3.8
Let \(U_i\), \(i\in \{1,2\}\), be a cutting \([n_i,k_i]_{q^m/q}\) system of \(V_i=V(k_i,q^m)\). If \(U_i\) is \((k_i1,n_im1+t_i)_q\)evasive, for each \(i\in \{1,2\}\) with \(t_1,t_2\ge 0\) and \(t_1+t_2<m+2\), then \(U_1\oplus U_2\) is a cutting \([n_1+n_2,k_1+k_2]_{q^m/q}\) system.
Proof
Let \(\Pi\) be a hyperplane of \(V_1\oplus V_2\). Then, \(\dim _{\mathbb{F}_q} \Pi =(k_1+k_21)m\). Also, \(\dim _{\mathbb{F}_q}(\Pi \cap U_i)\le n_i+m1\) and
Since \((\Pi \cap V_1)\oplus (\Pi \cap V_2)\) is a hyperplane of H and \(t_1+t_2<m+2\), we get
and hence the assertion. \(\square\)
3.3 Dual of a linear cutting blocking set
Let \(\sigma : V\times V\longrightarrow {\mathbb F}_{q^m}\) be a nondegenerate bilinear form on \(V=V(k,q^m)\) and define
where \(\mathrm{Tr}_{q^m/q}\) denotes the trace function of \(\mathbb F_{q^m}\) over \(\mathbb F_q\). Then, \(\sigma '\) is a nondegenerate bilinear form on V, when V is regarded as a kmdimensional vector space over \({\mathbb F}_{q}\). Let \(\tau\) and \(\tau '\) be the orthogonal complement maps defined by \(\sigma\) and \(\sigma '\) on the lattices of the \({\mathbb F}_{q^m}\)subspaces and \({\mathbb F}_{q}\)subspaces of V, respectively. Recall that if R is an \({\mathbb F}_{q^m}\)subspace of V and U is an \({\mathbb F}_{q}\)subspace of V, then \(U^{\tau '}\) is an \({\mathbb F}_{q}\)subspace of V, \(\dim _{{\mathbb F}_{q^m}}(R^\tau) +\dim _{{\mathbb F}_{q^m}}(R)=k\) and \(\dim _{{\mathbb F}_{q}} (U^{\tau '})+\dim _{{\mathbb F}_{q}} (U)= km\). It easy to see that \(R^\tau =R^{\tau '}\) for each \({\mathbb F}_{q^m}\)subspace R of V. For a more detailed explanation, we refer to [36, Chapter 7]).
With the notation above, \(U^{\tau '}\) is called the dual of U (with respect to \(\tau '\)). Up to \(\mathrm {GL}(k,q^m)\)equivalence, the dual of an \({\mathbb F}_{q}\)subspace of V does not depend on the choice of the nondegenerate bilinear forms \(\sigma\) and \(\sigma '\) on V. For more details, see [27]. If R is an sdimensional \({\mathbb F}_{q^m}\)subspace of V and U is a tdimensional \({\mathbb F}_{q}\)subspace of V, then
From (4) and from Theorem 3.3, the next results immediately follow.
Proposition 3.9
Let U be a scattered \([\frac{km}{2},k]_{q^m/q}\) system. Then, the following are equivalent:

1
U is \((2,m1)_q\)evasive,

2
\(U^{\tau '}\) is a \(\left( k2,\frac{km}{2}m1\right) _q\)evasive \([\frac{km}{2},k]_{q^m/q}\) system,

3
\(U^{\tau '}\) is a cutting \([\frac{km}{2},k]_{q^m/q}\) system.
Corollary 3.10
Let U be a scattered \([2m,4]_{q^m/q}\) system. Then, the following are equivalent:

1
U is cutting,

2
U is \((2,m1)_q\)evasive,

3
\(U^{\tau '}\) is a cutting \([2m,4]_{q^m/q}\) system,

4
\(U^{\tau '}\) is a \((2,m1)_q\)evasive \([2m,4]_{q^m/q}\) system.
3.4 The case \((k,m)=(4,3)\)
We conclude this section with a focus on a special case, namely \((k,m)=(4,3)\). In particular, in this case, we will determine the shortest length that a minimal rankmetric code of dimension k can have with respect to the field extension \({\mathbb F}_{q^m}/{\mathbb F}_{q}\).
Formally, denote by \(c_q(k,m)\) the smallest dimension of a linear cutting blocking set in \(V(k,q^m)\), or, equivalently, the length of the shortest minimal rankmetric code of dimension k, that is
From Proposition 3.7, we can deduce the recursive inequality given by
On the other hand, Proposition 2.16 can be rewritten as
and we have seen that this is not always an equality; see Corollary 3.5.
In this section, we determine the exact value \(c_q(4,3)\) for every prime power q. By Corollary 3.5, we can already deduce that \(c_q(4,3)\ge 7\). We will see that actually \(c_q(4,3)>7\) and this will be a consequence of the following more general bound on evasive qsystems.
Lemma 3.11
Let \(h \in \mathbb N\) be such that \(h\le k\). Let U be an \((h,h+1)_q\)evasive \([n,k]_{q^m/q}\) system. Then, for every \(1\le t \le h1\), we have
Proof
By way of contradiction, suppose that U is an \((h,h+1)_q\)evasive \([n,k]_{q^m/q}\) system with
Let us fix \(1\le t \le h1\). Since \(n>\frac{km}{ht+1}\), then U cannot be \((ht)\)scattered, and hence, it must be \((ht,ht+1)_q\)evasive. Thus, there exists an \({\mathbb F}_{q^m}\)subspace \(H\subseteq V(k,q^m)\) with \(\dim _{{\mathbb F}_{q^m}}(H)=ht\) and of weight \(ht+1\) in U. Let us project U from H over a \((kh+t)\)dimensional \({\mathbb F}_{q^m}\)subspace \(\Lambda\), with \(\Lambda \cap H=\{ 0\}\), and let us denote this projection map by \(\pi _H:V(k,q^m)\rightarrow \Lambda\). Since \(\ker (\pi _H)\cap U=H\cap U\), by restricting the map \(\pi _H\) to U, we obtain an \(\mathbb F_q\)subspace \(W:=\pi _H(U)\subseteq \Lambda\) that is an \([nh+t1,kh+t]_{q^m/q}\) system. By assumptions on n, the qsystem W is not tscattered, and hence, there is a tdimensional subspace \(H'\) of \(\Lambda\) of weight at least \(t+1\) in W. Therefore, the space \(\pi _H^{1}(H')\) is an hdimensional \({\mathbb F}_{q^m}\)subspace and \(\pi _H^{1}(H')\cap U=\pi _H^{1}(W)\), which has dimension \(\dim _{{\mathbb F}_{q}}(W\cap H')+\dim _{{\mathbb F}_{q}}(H\cap U)\ge (ht+1)+(t+1)=h+2\), a contradiction. \(\square\)
Corollary 3.12
There are no cutting \([7,4]_{q^3/q}\) systems.
Proof
By Theorem 3.3, if U is a cutting \([7,4]_{q^3/q}\) system, then U is \((2,3)_q\)evasive. The result follows from the previous lemma with \(k=4\), \(m=3\), \(h=2\), and \(n=7\). \(\square\)
Proposition 3.13
Let \(u\in {\mathbb F}_{q^3}\setminus \mathbb F_q\), the \(\mathbb F_q\)subspace
is a cutting \([8,4]_{q^3/q}\) system.
Proof
By Theorem 3.3, this is equivalent to show that U is \((2,4)_q\)evasive in \(V(4,q^3)\) and by Propositions 3.1 and 3.2, this is equivalent to show that U is \((1,2)_q\)evasive. Hence, it is sufficient to show that there are no points of weight 3 in U. By way of contradiction, suppose that a point \(P=\langle (\alpha _0+\alpha _1u,\alpha _2+\alpha _3u,\alpha _4+\alpha _5u,\alpha _6+\alpha _7u)\rangle _{{\mathbb F}_{q^m}}\) has weight 3 in U. Then, for each \(\lambda \in {\mathbb F}_{q^3}\), there exist \(\alpha _i^{\prime}\in \mathbb F_q\), \(i\in \{0,\ldots ,7\}\), such that
for each \(i\in \{0,1,2,3\}\), taking the indices modulo 8. Taking \(\lambda =u\) and \(\lambda =u^2\), from Eq. (5), we get \(\alpha _i=0\), for each \(i\in \{0,\ldots ,7\}\), a contradiction. \(\square\)
In other words, Corollary 3.12 and Proposition 3.13 mean that for every prime power q, we have
4 A \((2,3)_q\)evasive \([8,4]_{q^4/q}\) system and the associated rankmetric code
This section is dedicated to the existence of a linear cutting blocking set of dimension 8 in \(V(4,q^4)\). Or, in other words, to the existence of a scattered \([8,4]_{q^4/q}\) system which is also \((2,3)_q\)evasive.
The importance of this result is multiple, and it is related to the theory of rankmetric codes. On the one hand, it produces a construction of a minimal rankmetric code of dimension 4 with respect to the field extension \(\mathbb F_{q^4}/{\mathbb F}_{q}\) with shortest length. On the other hand, it provides the first example of a \([2m,2(md+1),d]_{q^m/q}\) MRD code which is not the direct sum of two \([m,md+1,d]_{q^m/q}\) MRD codes.
For the rest of this section, we define the \([8,4]_{q^4/q}\) system U to be the subspace of \(\mathbb F_{q^4}^{4}\).
4.1 Scatteredness and evasiveness
In this section, we only assume to be working over a finite field of characteristic 2. As a first step, we show for which finite fields \({\mathbb F}_{q}\), the \([8,4]_{q^4/q}\) system U is scattered.
Theorem 4.1
Let \(q=2^{h}\). Then, U is maximum scattered if and only if \(h\not \equiv 2 \pmod {4}\).
Proof
The \({\mathbb F}_{q}\)dimension of U is clearly 8. Let \(\lambda \notin \mathbb {F}_{q}\) be such that
The set U is maximum scattered if and only if the previous equation is satisfied only for \({u=v=0}\).
The above equation yields \(x=\lambda u\), \(y=\lambda v\),
This implies
that we rewrite as
If \(v=0,\) then \(F(u,v)=0\) implies \(u=0\).
So we suppose \(v\ne 0\). Then, \((v^{q^2}+u^{q^2})F(u,v)+v^{q^2}G(u,v)=0\) reads
Since \(\lambda \notin \mathbb{F}_q\)
Since the above expression is homogeneous, we may assume \(v=1\). Consider the polynomial \(\varphi (T):=T^{q+1}+T+1\). Any root t of \(\varphi (T)\) satisfies \(t^{q+1}+t+1=0\), and thus, \(t^{q}=1+1/t\), \(t^{q^2}=1+1/t^q=1/(t+1)\), \(t^{q^3}=t\). This shows that \(t\in \mathbb {F}_{q^3}\cap \mathbb {F}_{q^4}=\mathbb {F}_q\) and so \(t^2+t+1=0\). From this, we further deduce that the only possible roots of \(\varphi (T)\) in \(\mathbb F_{q^4}\) are in \(\{\omega ,\omega ^2\}\cap {\mathbb F}_{q}\), where \(\mathbb F_4=\{0,1,\omega ,\omega ^2\}\).

a
Let \(h\equiv 1 \pmod {2}\). In this case, we have \(\{\omega ,\omega ^2\}\cap \mathbb {F}_{q}=\emptyset\). Thus, there are no nonzero pairs \((u,v)\in \mathbb {F}_{q^4}^2\) such that \(v^{q}u+u^{q+1}+v^{q+1}=0\). So U is maximum scattered.

b
Let \(h\equiv 0 \pmod {4}\). In this case, \(\{\omega ,\omega ^2\}\subseteq \mathbb {F}_q\). Thus, \(v=\omega ^i u\), for some \(i=1,2\) and for a given \({u} \in {\mathbb{F}}_{q^4}\). We want to show that the equation
$$\begin{aligned} \phi_u(\lambda):=F(u,\omega^i u)=\omega^iu^{q^2}\lambda^{q^2} + u^q\lambda^q+(\omega^iu^{q^2}+u^q)\lambda=0 \end{aligned}$$admits at most \(q\) solutions in \(\lambda\), i.e. \(\phi_u(\lambda)=0\) if and only if \(\lambda\in\mathbb{F}_q\). Straightforward computations show that if \(t\in\mathbb{F}_{q^4}\) is a solution of \(\phi_u(\lambda)=0\) then t satisfies
$$\begin{aligned} (1+\omega ^i \gamma ^{q^2}+\omega ^i \gamma ^q)t^q+(\omega^i \gamma ^{q^2+1}+\gamma +1)t=0. \end{aligned}$$Hence, there more than q solutions only if \(1+\omega ^i \gamma ^{q^2}+\omega ^i \gamma ^q=\omega^i \gamma ^{q^2+1}+\gamma +1=0.\) From the second equation, we get \(\omega^i \gamma ^{q^2+1}+\gamma ^{q^2}+1=0\), and thus, \(\gamma \in \mathbb {F}_{q^2}\). So \(\omega \gamma ^{2}+\gamma +1=0\). Since \(\mathrm{Tr}_{q/2}(\omega )=0\) (recall that \(q=2^{4h^{\prime }}\)), \(\gamma\) belongs to \(\mathbb {F}_q\) and this contradicts \(0=1+\omega ^i \gamma ^{q^2}+\omega ^i \gamma ^q=1\). This shows that \(F(u,\omega^i u)=0\) if and only if \(\lambda \in \mathbb{F}_q\). Thus, U is scattered.

c
Let \(h\equiv 2 \pmod {4}\). Also, in this case, \(\{\omega ,\omega ^2\}\subseteq \mathbb {F}_q\) and \(u=\omega ^i v\), for some \(i=1,2\). Consider \(\overline{v}\) such that \(\overline{v}^2+\overline{v}+\omega ^2=0\) and \(\overline{u}=\omega \overline{v}\). Since \(h\equiv 2 \pmod {4}\), \(\mathrm{Tr}_{q/2}(\omega ^2)=1\), \(\overline{v}\in \mathbb {F}_{q^2}\setminus \mathbb {F}_q\) and \(\overline{u}^q=\overline{v}+1\). In this case, (7) vanishes and F(u, v) and G(u, v) are proportional. To prove that U is not scattered it is enough to prove that \(F(\omega \overline{v},\overline{v})= \overline{v} \lambda ^{q^2}+\omega (\overline{v}+1)\lambda ^q +(\overline{v}+\omega +\omega \overline{v})\lambda\) has \(q^2\) roots in \(\mathbb {F}_{q^4}\). To see this, note that any solution \(\lambda \in \mathbb {F}_{q^4}\) satisfies
$$\begin{aligned} \lambda ^{q^2}= & {} \omega \gamma \lambda ^q+(1+\omega \gamma )\lambda , \end{aligned}$$where \(\gamma = \frac{\overline{v}+1}{\overline{v}}\) satisfies \(\gamma ^{q}=1/\gamma =\gamma +\omega\). Thus,
$$\begin{aligned} \lambda ^{q^3}= & {} \omega \gamma ^q \lambda ^{q^2}+(1+\omega \gamma ^q)\lambda ^q\\= & {} \omega \gamma ^q \left( \omega \gamma \lambda ^q+(1+\omega \gamma )\lambda \right) +(1+\omega \gamma ^q)\lambda ^q\\= & {} \omega ^2 \lambda ^q+ \omega \gamma ^q (1+\omega \gamma )\lambda +(1+\omega \gamma ^q)\lambda ^q\\= & {} (\omega ^2+1+\omega \gamma ^q) \lambda ^q+ \omega \gamma ^q (1+\omega \gamma )\lambda , \end{aligned}$$and
$$\begin{aligned} \lambda ^{q^4}= & {} (\omega ^2+1+\omega \gamma ) \lambda ^{q^2}+ \omega \gamma (1+\omega \gamma ^q)\lambda ^q\\= & {} (\omega ^2+1+\omega \gamma ) (\omega \gamma \lambda ^q+(1+\omega \gamma )\lambda )+ \omega \gamma (1+\omega \gamma ^q)\lambda ^q=\lambda . \end{aligned}$$Therefore, \(F(\omega \overline{v},\overline{v})\) has \(q^2\) roots in \(\mathbb {F}_{q^4}\) and U is not scattered.
\(\square\)
We now switch to show that the \([8,4]_{q^4/q}\) system U is also \((2,3)_q\)evasive. In order to do this, we first need three technical auxiliary results.
Proposition 4.2
Let \(q=2^{h}\), \(h\not \equiv 2\pmod {4}\), \(A,B,C,D\in \mathbb {F}_{q^4}\), \(B^{q^2+1}\ne 1\), and
Then, \(\#\Lambda \le q^3\).
Proof
Denote by F(u, v) and G(u, v) the quantities \(v^{q^2}+Au+Bv+u^q\) and \(v^{q^2}+u^{q^2}+v^q+Cu+Dv\), respectively, where \(u,v\in \mathbb {F}_{q^4}\). Now, we have
and, therefore, if \((u,v)\in \Lambda\), then
Thus, we can compute
where
If at least one among \(\alpha ,\beta ,\gamma ,\delta\) is not zero, then \(\alpha u +\beta u^q+\gamma u^{q^2}+\delta u^{q^3}=0\) provides at most \(q^3\) possibilities for u, which together with (8) yields \(\#\Lambda \le q^3\).
Suppose now that \(\alpha =\beta =\gamma =\delta =0\). From \(\delta =0\), we get
and combining it with \(\beta =\gamma =0\), we obtain
Note that, \(B\ne 0\). Furthermore, we must have \(A\ne 0\), otherwise \(B^{q^3+q} + 1=(B^{q^2+1} + 1)^q=0\) and so \(B^{q^3+q}+B^{q^3} + 1\ne 0\) too.
Also, \(B\in \mathbb {F}_q\) implies
and so \(A\in \mathbb {F}_{q^2}\setminus \{0\}\). The equation \(A^qB^{q^3} + A^{q^3}B^{q^2} + B^{q^3+q} + 1=0\) reads \(B^2+1=0\), that is \(B=1\), a contradiction to the assumption \(B^{q^2+1}\ne 1\).
From now on, \(B\notin \mathbb {F}_q\). First, we want to determine the solutions in A to \(A^qB^{q^3} + A^{q^3}B^{q^2} + B^{q^3+q} + 1=0\). Note that, if there exist pairs \((x,y)\in \mathbb {F}_{q^4}^2\) such that
then either \(B^{q^3+q}\ne B^{q^2+1}\) or \(B^{q^3+q}= B^{q^2+1}\) and \((B^{q^3+q}+1)(B^{q^3}+B)=0\). The latter condition yields \(B\in \mathbb {F}_q\), a contradiction, so we only need to consider \(B^{q^3+q}\ne B^{q^2+1}\) and
This means that \(A^{q}=\frac{(B^{q^3+q}+1)(B^{q^2}+B^q)}{B^{q^3+q}+ B^{q^2+1}}\).
Now, \(A^{q^3+q^2} + B^{q^3+q}+B^{q^3} + 1=0\) yields
By direct checking, \(B^{q^3}H(B)+B^q(H(B))^{q^2}=(B^{q^2} + B)^{q}(B^{q^2+1} + 1)^{2q}(B^{q^3+q}+ B^{q^2+1})\), whose vanishing gives \(B\in \mathbb {F}_{q^2}\).
Thus, we need only to consider the case \(B \in \mathbb {F}_{q^2}\setminus \mathbb {F}_q\). In this case, \(H(B)=0\) reads \((B^q + B)^2(B^{q+2} + B^{4q}+ B^{3q} + 1)=0\). Since \(B\notin \mathbb {F}_q\), \(B^2=B^{3q}+B^{2q}+1/B^q\) and \(B^{2q}=B^{3}+B^{2}+1/B\ne 0\). So
that is
where \(\mathbb {F}_4^*=\langle \omega \rangle\).

a
If \(h\equiv 1 \pmod 2\), then \(\omega \in \mathbb {F}_{q^2}\setminus \mathbb {F}_q\) and from \(\mathrm{Tr}_{q^2/2}(\omega )=\mathrm{Tr}_{q^2/2}(\omega ^2)=1\) and any B satisfying \((B^2+B+\omega )(B^2+B+\omega ^2)=0\) does not belong to \(\mathbb {F}_{q^2}\), a contradiction.

b
If \(h\equiv 0 \pmod 4\), then \(\omega \in \mathbb {F}_{q}\) and from \(\mathrm{Tr}_{q/2}(\omega )=\mathrm{Tr}_{q/2}(\omega ^2)=0\) we conclude that any B satisfying \((B^2+B+\omega )(B^2+B+\omega ^2)=0\) belongs to \(\mathbb {F}_{q}\), again a contradiction.
This provides the final contradiction to \(\alpha =\beta =\gamma =\delta =0\) and therefore \(\Lambda \le q^3\). \(\square\)
Proposition 4.3
Let \(q=2^{h}\), \(A,B,C,D\in \mathbb {F}_{q^4}\), \(B^{q^2} =1/B\), and
Then, \(\#\Lambda \le q^3\).
Proof
We use the same notation as in the proof of Proposition 4.2. Now,
and
If \(A=0\), then \(AB^{q^2} u + B^{q^2}u^q+ A^{q^2}u^{q^2} + u^{q^3}=0\) has at most \(q^2\) solutions and this provides at most \(q^3\) pairs, since for each u, there are at most q values v such that \((A+C)u + u^q + u^{q^2} + (B+D)v + v^q=0\). So we can suppose \(A\ne 0\). With the same argument as above, we consider only the case in which \(AB^{q^2} u + B^{q^2}u^q+ A^{q^2}u^{q^2} + u^{q^3}\) has \(q^3\) roots in \(\mathbb {F}_{q^4}\) which is equivalent to \(A^{q+1}=B^q\). Note that,
where
If \(\epsilon \ne 0\) then \(\#\Lambda \le q^3\). Assume \(\epsilon = 0\). From
we conclude that if one among
does not vanish, then at most \(q^2\) values of u satisfy (12) and \(\#\Lambda \le q^3\). So
From \(A(B^{q}+B+D+1)^q+ C(B+D)^q=0\), we get
Thus,
Note that, if \(A^{q+1}+A^q+A=0\), then \(A=0\), a contradiction. So we can suppose \(A^{q+1}+A^q+A\ne 0\). Thus
and finally,
Then, \(A\in \mathbb {F}_q^*\), \(B=A^2\in \mathbb {F}_q\). Thus, from \(B^{q^2+1}=1\), \(B=1=A=C=D\). In this case, Eqs. (10) and (11) yield
and \(\#\Lambda \le q^3\).
\(\square\)
Proposition 4.4
Let \(q=2^{h}\), \(h\equiv 1\pmod 2\), and let \(A_{1,3},A_{1,4},A_{2,3},A_{2,4},A_{3,4}\in \mathbb {F}_{q^4}\) be such that \((A_{1,3},A_{2,3},A_{3,4})\ne (0,0,0)\). Then, the following system has at most \(q^2\) solutions (u, v): \(\in \mathbb{F}_{q^4}^2\)
Proof
If \(A_{2,3}=0\) and \(A_{1,3}\ne 0\), then \(v=0\) from the first equation and from the fourth one, there are at most \(q^2\) distinct pairs (u, 0).
If \(A_{2,3}=0=A_{1,3}\), then \(A_{3,4}\ne 0\). If \((A_{2,4},A_{1,4})=(0,0)\), then the unique solution is (0, 0). If \(A_{2,4}\ne 0\), then \(A_{2,4}u+A_{1,4} v=0=A_{3,4}v+A_{2,4}(u^q+v^{q^2})\) provide at most \(q^2\) solutions. The same holds if \(A_{1,4}\ne 0\).
Suppose now \(A_{2,3}\ne 0\). From \(A_{2,3}u+A_{1,3} v=0\), one gets \(u=\lambda v\) and
The three equations above vanish if and only if
Since \(A_{2,4}\ne 0\),
that is \((\lambda ^q)^{q+1}+(\lambda ^q)+1=0\) which has no solution if \(h\equiv 1 \pmod {2}\).
\(\square\)
We are now ready to prove that when q is an odd power of 2, the \([8,4]_{q^4/q}\) system U is \((2,3)_q\)evasive.
Theorem 4.5
Let \(q=2^{h}\), \(h\equiv 1 \pmod {2}\). Then, U is \((2,3)_q\)evasive.
Proof
We need to prove that any twodimensional \(\mathbb F_{q^4}\)subspace contains at most \(q^3\) vectors of U.
Let \(P=(x,y,x^q+y^{q^2},x^{q^2}+y^q+y^{q^2})\) and \(Q=(z,t,z^q+t^{q^2},z^{q^2}+t^q+t^{q^2})\) be two \(\mathbb F_{q^4}\)independent vectors of U. A vector \(R=(u,v,u^q+v^{q^2},u^{q^2}+v^q+v^{q^2})\) belongs to \(\langle P,Q\rangle _{\mathbb F_{q^4}}\) if and only if the rank of the following matrix is 2:
If \(xt+zy\ne 0\), then
By Propositions 4.2 and 4.3, the system above has at most \(q^3\) solutions \((u,v)\in \mathbb {F}_{q^4}^2\).
Suppose now \(xt+zy= 0\) then
where
Since the rank of
is 2, \((A_{1,3},A_{2,3},A_{3,4})\ne (0,0,0)\) otherwise \(x=y^q\) and \(z=t^q\) and from \(xt+yz=0\), one gets \(y/t=x/z\in \mathbb {F}_q^*\), a contradiction. The claim follows from Proposition 4.4. \(\square\)
4.2 The duality
Let \(\mathrm{Tr}_{{q^4}/q}\) denote the trace function of \(\mathbb F_{q^4}\) over \(\mathbb F_q\). The map \(\mathrm{Tr}_{{q^4}/q}(X_0X_3X_1X_2)\) defines a quadratic form of \(\mathbb F_{q^4}^4\) (regarded as \(\mathbb F_q\)–vector space) over \(\mathbb F_q\). The polar form associated with such a quadratic form is \(\sigma ':=(\mathrm{Tr}_{{q^4}/q}\circ \sigma ) : \mathbb F_{q^4}^4\times \mathbb F_{q^4}^4\longrightarrow {\mathbb F}_{q}\), where
If f is an \(\mathbb F_q\)–linear map from \(\mathbb F_{q^4}\) to \(\mathbb F_{q^4}\), we will denote by \(f^\top\) the adjoint of f with respect to the bilinear form of \(\mathbb F_{q^4}\) (treated as \(\mathbb F_q\)–vector space) \(\mathrm{Tr}_{q^4/q}(xy)\). In other words, the adjoint \(f^\top\) of f is defined by the rule: \(\mathrm{Tr}_{q^4/q}(xf(y))=\mathrm{Tr}_{q^4/q}(yf^\top (x))\) for any \(x,y \in \mathbb F_{q^4}\).
Let \(h_1,h_2,g_1,g_2\) be \(\mathbb F_q\)linear maps over \(\mathbb F_{q^4}\), and let
be an \(\mathbb F_{q}\)subspace of \(\mathbb F_{q^4}^4\) of dimension 8. Straightforward computations show that the orthogonal complement of X with respect to the \(\mathbb F_q\)–bilinear form \(\sigma '\) is
Hence, for \(q=2^h\), \(h\equiv 1\pmod 2\), the orthogonal complement of U is the \([8,4]_{q^4/q}\) system
Proposition 4.6
The \(\mathbb F_q\)subspaces U and \(U^{\tau '}\) are \(\mathrm {GL}(4,q^4)\)equivalent.
Proof
Straightforward computations show that
putting
\(\square\)
Corollary 4.7
For any \(\mathcal C\in \Psi ([U])\) and \(\mathcal D\in \Psi ([U^{\tau '}])\), we have that \(\mathcal C\) and \(\mathcal D\) are equivalent. In other words,
Remark 4.8
In [6, Section 3], another type of duality has been introduced. Let U be an ndimensional \(\mathbb F_q\)subspace of a vector space \(V=V(k,q^m)\), with \(n>k\). By [20, Theorems 1, 2] (see also [19, Theorem 1]), there is an embedding of V in \(Z=V(n,q^m)\) with \(Z=V \oplus \Gamma\) for some \((nk)\)dimensional \(\mathbb F_{q^m}\)subspace \(\Gamma\) such that \(U=\langle W,\Gamma \rangle _{\mathbb F_{q}}\cap V\), where W is a ndimensional \(\mathbb F_q\)subspace of Z, \(\langle W\rangle _{\mathbb F_{q^m}}=Z\) and \(\Gamma \cap V=W\cap \Gamma =\{{ 0}\}\). Then, the quotient space \(Z/\Gamma\) is isomorphic to V and under this isomorphism U is the image of the \(\mathbb F_q\)subspace \(W+\Gamma\) of \(Z /\Gamma\). Now, let \(\beta ':W\times W\rightarrow \mathbb F_{q}\) be a nondegenerate bilinear form on W. Then, \(\beta '\) can be extended to a nondegenerate bilinear form \(\beta :Z\times Z\rightarrow \mathbb F_{q^m}\). Let \(\perp\) and \(\perp '\) be the orthogonal complement maps defined by \(\beta\) and \(\beta '\) on the lattice of \(\mathbb F_{q^m}\)subspaces of Z and of \(\mathbb F_q\)subspaces of W, respectively.
The kdimensional \(\mathbb F_q\)subspace \(W+\Gamma ^{\perp }\) of the quotient space \(Z/\Gamma ^{\perp }\) will be denoted by \(\bar{U}\) and we call it the Delsarte dual of U with respect to \(\beta '\). By [6, Remark 3.7], up to \(\mathrm{GL}(n,q)\)equivalence, the Delsarte dual of an ndimensional \(\mathbb F_q\)subspace does not depend on the choice of the nondegenerate bilinear form on W.
Let U be the \((2,3)_q\)evasive \(\mathbb F_q\)subspace of \(V=\mathbb F_{q^4}^4\) defined in (6). Using the notations above, we can embed V in \(Z=\mathbb F_{q^4}^8\) in such a way that
Straightforward computations show that \(U=\langle W,\Gamma \rangle _{\mathbb F_{q}}\cap V\).
Let \((\mathbf{x},\mathbf{y}):=(x,y,x^q,y^q,x^{q^2},y^{q^2},x^{q^3},y^{q^3}), ({\bf u},{\bf v}):=(u,v,u^q,v^q,u^{q^2},v^{q^2},u^{q^3},v^{q^3})\) and consider the bilinear form \(\beta '\) on W defined as
Then,
Hence, the Delsarte dual \(\bar{U}=\langle W,\Gamma ^\perp \rangle _{\mathbb F_{q}}\cap \Delta\), where
turns out to be
which is equivalent to U (cf. (13) and Proposition 4.6).
4.3 The associated MRD code
From a coding theoretic point of view, the existence of the \([8,4]_{q^4/q}\) system U opens new perspectives and shows the existence of MRD codes “which are better than others”. The last sentence is in quotes because there are several criteria for which a code might be thought to be better than another, and our purpose is not to underline a better performance in every aspect. What we mean with that sentence is that the generalized rank weights of this code are actually larger than the ones of the already known MRD codes with the same parameters.
For the rest of this section, we fix an \([8,4]_{q^4/q}\) code \(\mathcal C\) associated with U and study its parameters, comparing them to those of the known constructions of MRD codes and to the best possible parameters that an \([8,4]_{q^4/q}\) code can have. Concretely, we can take \(\mathcal C\) to be the \([8,4]_{q^4/q}\) code with generator matrix
where \((\alpha _1,\alpha _2,\alpha _3,\alpha _4)\) and \((\beta _1,\beta _2,\beta _3,\beta _4)\) are both \({\mathbb F}_{q}\)bases of \(\mathbb F_{q^4}\).
The following is just a rewriting of Theorems 4.1 and 4.5, together with the fact that codes associated with scattered \([\frac{km}{2},k]_{q^m/q}\) systems are MRD, i.e. their parameters meet (2) with equality; see [5, Theorem 3.2].
Proposition 4.9
Let \(q=2^h\), with \(h \equiv 1 \pmod 2\). Then, \(\mathcal C\) is an \([8,4,(3,5,7,8)]_{q^4/q}\) code. In other words, \(\mathcal C\) is an \([8,4]_{q^4/q}\) MRD code, whose generalized rank weights are
Proof
Recall that, from Theorem 2.13, if \(\mathcal C\) is an \([n,k]_{q^m/q}\) code, then \({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},kh}(\mathcal C) = nr\) if and only if \(\mathcal U\) is \((h,r)_q\)evasive but not \((h,r1)_q\)evasive. Applying this theorem with \(k=4\) and \(n=8\), since U is scattered, U is \((1,1)_q\)evasive and \((3,5)_q\)evasive [4, Theorem 4.2], and hence, \({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},1}(\mathcal C) = 3\) and \({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},3}(\mathcal C) = 7\). Since U is \((2,3)_q\)evasive but it is not a 2scattered, \({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},2}(\mathcal C) = 5\).
\(\square\)
By the Singleton bound (2), the minimum rank distance, that is the first generalized rank weight of \(\mathcal C\), attains the maximum possible value. In other words, \(\mathcal C\) is MRD. This is not a big news, since MRD codes with the same parameters were already known, and constructed as the direct sum of two \([4,2]_{q^4/q}\) MRD codes (e.g. DelsarteGabidulin codes). However, codes obtained as direct sum of MRD codes have generalized rank weights different from those of \(\mathcal C\). This is explained by the following general result.
Proposition 4.10
Let \({\mathcal C}_1,{\mathcal C}_2\) be two \([n,k,nk+1]_{q^m/q}\) MRD codes. Then, \({\mathcal C}_1 \oplus {\mathcal C}_2\) is a \([2n,2k]_{q^m/q}\) code whose generalized rank weights are given by
Proof
Let us divide the proof in four steps.

a
First of all, by the monotonicity of Proposition 2.6(1), since \(\mathcal C_1\) and \(\mathcal C_2\) are MRD codes of length \(n\le m\), we must have
$$\begin{aligned} {{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},i}(\mathcal C_j)=nk+i, \qquad \text{ for } \text{ each } i \in \{1,\ldots ,k\}, j \in \{1,2\}. \end{aligned}$$In particular, \(\mathcal C_1\) and \(\mathcal C_2\) are \([n,k,(nk+1,nk+2,\ldots ,n)]_{q^m/q}\) codes.

b
Let us write \(\mathcal D:=\mathcal C_1\oplus \mathcal C_2\) and let
$$\begin{aligned} d_i:={{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},i}(\mathcal D),\quad \text{ for } \text{ each } i \in \{1,\ldots , 2k\}. \end{aligned}$$Since every codeword in \(\mathcal D\) is of the form \((u \, \mid \, v)\), with \(u\in \mathcal C_1\), \(v\in \mathcal C_2\), it is clear that the minimum rank distance of \(\mathcal D\)which is the first generalized rank weightcoincides with the minimum among the minimum rank distances of \(\mathcal C_1\) and \(\mathcal C_2\), i.e.
$$\begin{aligned} d_1=nk+1. \end{aligned}$$Now, let \(V=V(k,q^m)\) and let \(U_1, U_2\) be two \([n,k,(nk+1,nk+2,\ldots ,n)]_{q^m/q}\) systems associated with \(\mathcal C_1\) and \(\mathcal C_2\), respectively. The \([2n,2k]_{q^m/q}\) system \(U_1\oplus U_2 \subseteq V\oplus V=V(2k,q^m)\) is then associated with the code \(\mathcal D\). Now, for each \(i \in \{2,\ldots ,k\}\), consider an \({\mathbb F}_{q^m}\)subspace of codimension i in \(V\oplus V\), given by \(\Pi _i=V\oplus H_i\), where \(H_i\) is an \({\mathbb F}_{q^m}\)subspace of codimension i in V such that
$$\begin{aligned} {{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},i}(\mathcal C_2)=n\dim _{{\mathbb F}_{q}}(U_2\cap H_i)=nk+i. \end{aligned}$$Then, for each \(i \in \{2,\ldots ,k\}\), we have
$$\begin{aligned} d_i&= 2n\max \{\dim _{{\mathbb F}_{q}}((U_1\oplus U_2)\cap \Pi ) \,:\, \Pi \subseteq V\oplus V \text{ with } \dim _{{\mathbb F}_{q^m}}(\Pi )=2ki \} \\&\le 2n\dim _{{\mathbb F}_{q}}((U_1\oplus U_2)\cap \Pi _i)\\&=2n\dim (U_1)\dim (U_2\cap H_i)=nk+i. \end{aligned}$$On the other hand, since \(d_1=nk+1\), by the monotonicity of Proposition 2.6(1), we have \(d_i\ge nk+i\) for each \(i \in \{2,\ldots ,k\}\), and thus equality.

c
Let us now consider the dual code \(\mathcal D^\perp\), which is a \([2n,2n2k,(d_1^\perp ,\ldots , d_{2n2k}^\perp )]_{q^m/q}\) code. It is easy to see that \(\mathcal D^\perp =\mathcal C_1^\perp \oplus \mathcal C_2^\perp\). However, since the dual of an MRD is itself MRD, by step (a) \(\mathcal C_1^\perp\) and \(\mathcal C_2^\perp\) are both \([n,nk,(k+1,\ldots ,n)]_{q^m/q}\) codes, and by step (b) the first \(nk\) generalized rank weights of \(\mathcal D^\perp\) are
$$\begin{aligned} d_i^\perp =k+i, \quad \text{ for } \text{ each } i \in \{1,\ldots , nk\}. \end{aligned}$$ 
d
By the Weitype duality of Proposition 2.6(2), we have
$$\begin{aligned}&\{d_{k+1},\ldots ,d_{2k} \}\cup \{2n+1d_{nk+1}^\perp ,\ldots ,2n+1d_{2n2k}^\perp \}\\&=\{1,\ldots , nk\}\cup \{2nk+1,\ldots ,2n\}, \end{aligned}$$which forces, by the monotonicity of Proposition 2.6(1), to have
$$\begin{aligned} d_{k+i}=2nk+i, \quad \text{ for } \text{ each } i \in \{1,\ldots ,k\}, \end{aligned}$$concluding the proof.
\(\square\)
The following result immediately follows from Proposition 4.10.
Corollary 4.11
If \(\mathcal C_1,\mathcal C_2\) are two \([4,2]_{q^4/q}\) MRD codes, then \({\mathcal C}_1\oplus {\mathcal C}_2\) is an \([8,4,(3,4,7,8)]_{q^4/q}\) code. In other words, \({\mathcal C}_1\oplus {\mathcal C}_2\) is an \([8,4]_{q^4/q}\) MRD code, whose generalized rank weights are
Let us fix now \(\mathcal D_1,\mathcal D_2\) to be two arbitrary \([4,2]_{q^4/q}\) MRD codes. Hence, comparing the results of Proposition 4.9 and Corollary 4.11, we have that first, third, and fourth generalized rank weights of the codes \(\mathcal C\) and \(\mathcal D_1\oplus \mathcal D_2\) coincide, but
explaining finally what we meant with the claim that the MRD code \(\mathcal C\) is “better” than the MRD code \(\mathcal D_1\oplus \mathcal D_2\).
The second difference that we want to underline between \(\mathcal C\) and \(\mathcal D_1\oplus \mathcal D_2\) concerns their minimality. Indeed, we obtain the following.
Corollary 4.12
The code \(\mathcal C\) is minimal, while the code \(\mathcal D_1\oplus \mathcal D_2\) is not.
Proof
It immediately follows from Theorem 3.4. \(\square\)
Remark 4.13
Apart from being better than those of the type \(\mathcal D_1\oplus \mathcal D_2\), the generalized rank weights of \(\mathcal C\) are actually the largest possible ones for the given parameters \((n,k,m)=(8,4,4)\). Indeed, by Proposition 2.5, it is immediate to see that \({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},1}(\mathcal C)\), \({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},3}(\mathcal C)\), and \({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},4}(\mathcal C)\) are the largest possible values. Furthermore, if there exists an \([8,4]_{q^4/4}\) code \(\mathcal D\) such that \({{\,\mathrm{d}\,}}_{{{\,\mathrm{rk}\,}},2}(\mathcal D)\ge 6\), then Theorem 2.13 yields the 2scatteredness of the \([8,4]_{q^4/4}\) system W associated to \(\mathcal D\). However, this is not possible due to the bound on hscattered system \([n,k]_{q^m/q}\) systems given by
proved in [6, Theorem 2.3], which in this case would read as \(8\le \frac{16}{3}\), a contradiction.
One can see by Proposition 2.6(2) that the dual code \(\mathcal C^\perp\) is also an \([8,4,(3,5,7,8)]_{q^4/q}\) code. However, we can say more about the dual of \(\mathcal C\).
Proposition 4.14
The dual code \(\mathcal C^\perp\) is equivalent to \(\mathcal C\).
Proof
Let us fix a normal \({\mathbb F}_{q}\)basis \({\underline{\alpha }}:=(\alpha , \alpha ^{q}, \alpha ^{q^2},\alpha ^{q^3})\) of \(\mathbb F_{q^4}\), and let \(\underline{\gamma }:=(\gamma ,\gamma ^q,\gamma ^{q^2},\gamma ^{q^3})\) be its dual basis with respect to the trace. A generator matrix for (a code in the equivalence class of) \(\mathcal C\) is given by
where \(\underline{\alpha }^{q^i}\) denotes the vector obtained from \(\underline{\alpha }\) by raising each entry to the \(({q^i})\)th power. Straightforward computations show that the dual of \(\mathcal C\) is generated by the matrix
From this, it is immediate to see that the (equivalence class of the) qsystem associated with \(\mathcal C^\perp\) is \(U^{\tau '}\) defined in (13). The claim now follows from Corollary 4.7. \(\square\)
5 Conclusion and open problems
In this work, we analysed short minimal rankmetric codes, or, equivalently, small linear cutting blocking sets. We managed to characterize them in terms of the second generalized weight, showing that a rankmetric code is minimal if and only if its second generalized rank weight is larger than the underlying field extension degree (Theorem 3.4). This result was proved using the evasiveness properties of the associated qsystem that characterize a linear cutting blocking set (Theorem 3.3). Hence, motivated by finding small linear cutting blocking sets, we provide a construction of the smallest one in \(V(4,q^4)\), when q is an odd power of 2 (Theorem 4.5). As a byproduct, this construction produces a minimal \([8,4]_{q^4/q}\) rankmetric code which is also MRD and it is the first example of an \([8,4]_{q^4/q}\) MRD code that it is not obtained as a direct sum of two \([4,2]_{q^4/q}\) MRD codes, and hence, it provides a genuinely new MRD code. In addition, the parameters are also different, as we show that the generalized rank weights of this new MRD code are larger than those of the previously known MRD codes; see Table 1 for all the comparisons. This result opens new concrete research directions, since it tells us that there are MRD codes which are better than others. However, first one has to quantify how much better one can do, finding better bounds for the generalized rank weight of a code.
Open Problem 1 Find new bounds for the generalized rank weights of an \([n,k]_{q^m/q}\) code, improving on the bounds of Proposition 2.5.
Among the properties of the qsystem U and of its associated codes, an important feature that gives hope to generalize it for larger ambient spaces is its extremely compact and elementary description. Thus, it would be nice to determine if it might be a special case of a more general pattern. However, this can be done in two directions.
Open Problem 2 Generalize the construction of the qsystem U of Sect. 4 in order to obtain more general MRD codes with higher generalized weights.
Open Problem 3 Generalize the construction of the qsystem U of Sect. 4 in order to obtain more general short minimal rankmetric codes.
References
Alfarano, G.N., Borello, M., Neri, A., Ravagnani, A.: Linear cutting blocking sets and minimal codes in the rank metric. J. Combi. Theory, Series A, 2022, to appear. arXiv:2106.12465
Bartoli, D., Csajbók, B., Marino, G., Trombetti, R.: Evasive subspaces. J. Comb. Des. 29(8), 533–551 (2021)
Bartoli, D., Giulietti, M., Marino, G., Polverino, O.: Maximum scattered linear sets and complete caps in Galois spaces. Combinatorica 38(2), 255–278 (2018)
Blokhuis, A., Lavrauw, M.: Scattered spaces with respect to a spread in \(\rm PG(n, q)\). Geom. Dedicata 81(1–3), 231–243 (2000)
Csajbók, B., Marino, G., Polverino, O., Zullo, F.: Maximum scattered linear sets and MRDcodes. J. Algebraic Comb. 46(3), 517–531 (2017)
Csajbók, B., Marino, G., Polverino, O., Zullo, F.: Generalising the scattered property of subspaces. Combinatorica 41, 237–262 (2021)
Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226–241 (1978)
Ducoat, J., Kyureghyan, G.: Generalized rank weights: a duality statement. Top. Finite Fields 632, 101–109 (2015)
Dvir, Z., Lovett, S.: Subspace evasive sets. In: Proceedings of the 44th ACM Symposium on Theory of Computing, pp. 351–358 (2012)
Gabidulin, E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3–16 (1985)
Gabidulin, E.M., Paramonov, A., Tretjakov, O.: Ideals over a noncommutative ring and their application in cryptology. In: Workshop on the Theory and Application of Cryptographic Techniques, pp. 482–489. Springer (1991)
Ghorpade, S.R., Johnsen, T.: A polymatroid approach to generalized weights of rank metric codes. Des. Codes Cryptogr. 88(12), 2531–2546 (2020)
Guruswami, V.: Linearalgebraic list decoding of folded ReedSolomon codes. In: Annual IEEE Conference on Computational Complexity, pp. 77–85 (2011)
Guruswami, V., Wang, C., Xing, C.: Explicit listdecodable rankmetric and subspace codes via subspace designs. IEEE Trans. Inf. Theory 62(5), 2707–2718 (2016)
Jurrius, R., Pellikaan, R.: On defining generalized rank weights. Adv. Math. Commun. 11(1), 225–235 (2017)
Kurihara, J., Matsumoto, R., Uyematsu, T.: Relative generalized rank weight of linear codes and its applications to network coding. IEEE Trans. Inf. Theory 61(7), 3912–3936 (2015)
Kurihara, J., Uyematsu, T., Matsumoto, R.: New parameters of linear codes expressing security performance of universal secure network coding. In: 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 533–540. IEEE (2012)
Loidreau, P.: Etude et optimisation de cryptosystèmes à clé publique fondés sur la théorie des codes correcteurs, PhD thesis, ANRT (2001)
Lunardon, G., Polito, P., Polverino, O.: A geometric characterisation of linear \(k\)blocking sets. J. Geom. 74(1–2), 120–122 (2002)
Lunardon, G., Polverino, O.: Translation ovoids of orthogonal polar spaces. Forum Mathematicum 16, 663–669 (2004)
Marino, G., Neri, A., Trombetti, R.: Evasive subspaces, generalized rank weights and near MRD codes. arXiv:2204.11791
MartínezPeñas, U.: On the similarities between generalized rank and Hamming weights and their applications to network coding. IEEE Trans. Inf. Theory 62(7), 4081–4095 (2016)
MartínezPeñas, U., Matsumoto, R.: Relative generalized matrix weights of matrix codes for universal security on wiretap networks. IEEE Trans. Inf. Theory 64(4), 2529–2549 (2017)
Massey, J.L.: Minimal codewords and secret sharing. In: Proc. 6th Joint SwedishRussian Int. Workshop on Info. Theory, Mölle, Sweden, pp. 276–279 (1993)
Massey, J.L.: Some applications of coding theory in cryptography. In: Codes and Cyphers: Cryptography and Coding IV, Esses, England, pp. 33–47 (1995)
Oggier, F., Sboui, A.: On the existence of generalized rank weights. In: 2012 International Symposium on Information Theory and its Applications, pp. 406–410. IEEE (2012)
Polverino, O.: Linear sets in finite projective spaces. Discrete Math. 310(22), 3096–3107 (2000)
Pudlák, P., Rödl, V.: Pseudorandom sets and explicit constructions of Ramsey graphs. Quaderni di Matematica 13, 327–346 (2004)
Randrianarisoa, T.H.: A geometric approach to rank metric codes and a classification of constant weight codes. Des. Codes Cryptogr. 88, 1331–1348 (2020)
Ravagnani, A.: Generalized weights: an anticode approach. J. Pure Appl. Algebra 220(5), 1946–1962 (2016)
Rawat, A.S., Koyluoglu, O.O., Silberstein, N., Vishwanath, S.: Optimal locally repairable and secure codes for distributed storage systems. IEEE Trans. Inf. Theory 60(1), 212–236 (2013)
Roth, R.M.: Maximumrank array codes and their application to crisscross error correction. IEEE Trans. Inf. Theory 37(2), 328–336 (1991)
Sheekey, J.: A new family of linear maximum rank distance codes. Adv. Math. Commun. 10(3), 475–488 (2016)
Sheekey, J.: (Scattered) Linear Sets are to RankMetric Codes as Arcs are to HammingMetric Codes. In: Greferath, M., Hollanti, C., Rosenthal, R. (eds). Oberwolfach Report No. 13/2019 (2019)
Silva, D., Kschischang, F.R., Koetter, R.: A rankmetric approach to error control in random network coding. IEEE Trans. Inf. Theory 54(9), 3951–3967 (2008)
Taylor, D.E.: The Geometry of the Classical Groups. Sigma Series in Pure Mathematics, vol. 9. Heldermann, Berlin (1992)
Zini, G., Zullo, F.: Scattered subspaces and related codes. Des. Codes Cryptogr. 89, 1853–1873 (2021)
Acknowledgements
This research was supported by the Italian National Group for Algebraic and Geometric Structures and their Applications (GNSAGA  INdAM).
Funding
Open access funding provided by Università degli Studi di Perugia within the CRUICARE Agreement.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Bartoli, D., Marino, G. & Neri, A. New MRD codes from linear cutting blocking sets. Annali di Matematica 202, 115–142 (2023). https://doi.org/10.1007/s10231022012355
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10231022012355
Keywords
 MRD codes
 Cutting blocking sets
 qsystems
 Evasive subspaces
 Strong blocking sets
 Generalized rank weights