Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
Nicola Durante, Alessandro Siciliano

TL;DR
This paper constructs infinite families of non-linear maximum rank distance codes using bilinear forms and finite geometry models, extending recent results and providing a geometric perspective on these codes.
Contribution
It introduces new infinite families of non-linear maximum rank distance codes via geometric methods and relates them to existing codes in the literature.
Findings
Constructed infinite families of non-linear maximum rank distance codes.
Provided a geometric description using the cyclic model for field reduction.
Unified and extended previous non-linear code constructions.
Abstract
In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the field reduction of finite geometries and we show that these families contain the non-linear maximum rank distance codes recently provided by Cossidente, Marino and Pavese.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
N. Durante and A. Siciliano
Abstract
In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the field reduction of finite geometries and we show that these families contain the non-linear maximum rank distance codes recently provided by Cossidente, Marino and Pavese.
1 Introduction
Let , , be the rank metric space of all the matrices with entries in the finite field with elements, , a prime. The distance between two matrices by definition is the rank of their difference. An -rank distance code (also rank metric code) is any subset of such that the minimum distance between two of its distinct elements is . An -rank distance code is said to be linear if it is a linear subspace of .
It is known [11] that the size of an -rank distance code is bounded by the Singleton-like bound:
[TABLE]
When this bound is achieved, is called an -maximum rank distance code, or -MRD code, for short.
Although MRD codes are very interesting by their own and they caught the attention of many researchers in recent years [1, 9, 32], such codes have also applications in error-correction for random network coding [18, 22, 37], space-time coding [38] and cryptography [17, 36].
Obviously, investigations of MRD codes can be carried out in any rank metric space isomorphic to . In his pioneering paper [11], Ph. Delsarte constructed linear MRD codes for all the possible values of the parameters , , and by using the framework of bilinear forms on two finite-dimensional vector spaces over a finite field (Delsarte used the terminology Singleton systems instead of maximum rank distance codes).
Few years later, Gabidulin [16] independently constructed Delsarte’s linear MRD codes as evaluation codes of linearized polynomials over a finite field [26]. That construction was generalized in [21] and these codes are now known as Generalized Gabidulin codes.
In the case , a different construction of Delsarte’s MRD codes was given by Cooperstein [7] in the framework of the tensor product of a vector space over by itself. Very recently, Sheekey [35] and Lunardon, Trombetti and Zhou [28] provide some new linear MRD codes by using linearized polynomials over .
In finite geometry, -MRD codes are known as spread sets [12]. To the extent of our knowledge the only non-linear MRD codes that are not spread sets are the -MRD codes constructed by Cossidente, Marino and Pavese in [8]. They got such codes by looking at the geometry of certain algebraic curves of the projective plane . Such curves, called -sets, were introduced and studied by Donati and Durante in [13]. In this paper, we construct infinite families of non-linear -MRD codes, for and . We also show that the Cossidente, Marino and Pavese non-linear MRD codes belong to these families. Our investigation will carry out in the framework of bilinear forms on a finite dimensional vector space over .
Let be the set of all bilinear forms on , where denotes an -dimensional vector space over . Clearly, is an -dimensional vector space over .
The *left radical * of any by definition is the subspace of consisting of all vectors satisfying for every . The rank of is the codimension of , i.e.
[TABLE]
Let be a basis of . For a given , the matrix , is called the *matrix * of in the basis and the map
[TABLE]
is an isomorphism of rank metric spaces giving .
The group acts on as a subgroup of : for every , the image of any is defined to be the bilinear form given by
[TABLE]
Any naturally defines a semilinear transformation of . For any and , we can define the bilinear form .
The involutorial operator , where is given by
[TABLE]
is an automorphism of . It turns out that the above automorphisms are all the elements in , i.e. .
Two MRD codes and are said to be equivalent if there exists such that .
This paper is organized as follows. In Section 2 we introduce a cyclic model of . In this model we construct infinite families of non-linear MRD codes. More precisely, for , and any subset of , we provide a subset of which turns out to be a non-linear -MRD code (Theorem 2.19).
In Section 3 we give a geometric description of such codes. If a given rank distance code is considered as a subset of , then one can consider the corresponding set of projective points in under the canonical homomorphism . We prove (Theorem 3.5) that the projective set defined by , with , is a subset of a Desarguesian -spread of [34] consisting of two spread elements, pairwise disjoint Segre varieties [20] and hyperreguli [30]. Additionally, if one consider the projective space as the field reduction of over , then the projective set defined by is, in fact, the field reduction of the union of two projective points, mutually disjoint -dimensional -subgeometries and scattered -linear sets of pseudoregulus type of [13, 24, 29]. The main tool we use to get the above geometric description is the field reduction of over in the cyclic model for the tensor product as described in [7].
2 The non-linear MRD codes in the cyclic model of bilinear forms
In the paper [7], the cyclic model of the -dimensional vector space over was introduced by taking eigenvectors, say , of a given Singer cycle of , where a Singer cycle of is an element of of order . Since the vectors have distinct eigenvalues over , they form a basis of the extension of . In this basis the vector space is represented by
[TABLE]
We call a Singer basis of and the above representation is called the cyclic model for [19, 15].
The set of all dimensional subspaces of spanned by vectors in the cyclic model for is called the cyclic model for the projective space . Note that the above cyclic model corresponds to the cyclic model of where the points are identified with the elements of the group [19, pp. 95–98] [15]. Very recently, the cyclic model for has been used to give an alternative model for the triality quadric [2].
Let be the dual vector space of with basis , the dual basis of the Singer basis . Then the dual vector space of is
[TABLE]
A linear transformation from to itself is called an endomorphism of . We will denote the set of all endomorphisms of by .
An Dickson matrix (or -circulant matrix) over is a matrix of the form
[TABLE]
with . We say that the above matrix is generated by the array .
Let denote the Dickson matrix algebra formed by all Dickson matrices over . The set of all invertible Dickson matrices is known as the Betti-Mathieu group [6].
Proposition 2.1**.**
[39, Lemma 4.1]** and .
A polynomial of the form
[TABLE]
is called a linearized polynomial (or q-polynomial) over . It is known that every endomorphism of over can be represented by a unique polynomial [33].
Let be the set of all -polynomials over . In the paper [39], it was showed that the map
[TABLE]
is an isomorphism between the non-commutative algebras and . From Proposition 2.1 we see that any Singer basis of realizes this isomorphism.
Proposition 2.2**.**
Let be a Singer basis of . Then the matrix of any with respect to is an Dickson matrix. Conversely, every Dickson matrix defines a bilinear form on .
Proof.
Let be an Dickson matrix generated by the -ple over . Let be the bilinear mapping on defined by
[TABLE]
where subscripts are taken modulo , and then extended over by linearity. Set and let denote the trace function from onto :
[TABLE]
It is easily seen that the action of on is given by
[TABLE]
with , which is a bilinear form on . The assertion follows from consideration on the size of .
For any -ple over , will denote the bilinear form having matrix in the Singer basis . For any set of ples over we put
[TABLE]
Corollary 2.3**.**
Let . Then
[TABLE]
is an isomorphism of rank metric spaces giving .
Remark 2.4**.**
By Proposition 2.1, is represented by the group in the Singer basis . Here, denote transposition in and it corresponds to the operator .
Remark 2.5**.**
Note that coincides with the bilinear form in [11] when .
Remark 2.6**.**
Since a change of basis in preserves the rank of bilinear forms, for any given we can consider its matrix representation in the Singer basis . Therefore, we can assume for some -ple over , so that is the set of vectors , , such that .
We are now in position to construct non-linear MRD codes as subsets of .
Let denote the norm map from onto :
[TABLE]
For every nonzero element , let
[TABLE]
Remark 2.7**.**
The matrix of the Singer cycle of in the basis is , where is a generator of the multiplicative group of [7]. If is the Singer cyclic group generated by , then the set is the -orbit of the bilinear form , with . It turns out that the bilinear forms in have constant rank.
Proposition 2.8**.**
* if and only if .*
Proof.
Let such that . By Remark 2.7 it suffices to show that is in .
Since , then for some . As
, we have
[TABLE]
Conversely, let . Then
[TABLE]
for some . From the last equation we get
[TABLE]
By taking into account the first and second equation of (4) we get
[TABLE]
We will write instead of , if is an element of with .
Lemma 2.9**.**
Every has size .
Proof.
Let with . Clearly, we have
[TABLE]
if and only if , for . If we compare the equalities with and , we get . For every fixed there are exactly elements in such that .
Let and be fixed elements in . Then, for each element such that we get the unique element and the result is proved.
Lemma 2.10**.**
- i)
If , then .
- ii)
If , then , for any and , with if .
Proof.
i) Let . It suffices to note that is the equation of a hyperplane in the cyclic model of .
ii) By Remark 2.7, we can assume , with .
Let , with .
Suppose there exist linearly independent over such that . Then we get
[TABLE]
and
[TABLE]
for .
After subtracting Equation (5) side-by-side from Equation (6) multiplied by , we get
[TABLE]
for . Then, the ple
[TABLE]
is a solution of the linear system
[TABLE]
with .
The generic solution of (9) has
[TABLE]
and
[TABLE]
In the expression (11) set
[TABLE]
in particular giving . Similarly, in the expression (10) set
[TABLE]
We have,
[TABLE]
and . We then write
[TABLE]
By plugging (8) in the right-hands of the above equalities we get
[TABLE]
and
[TABLE]
Therefore
[TABLE]
From (8), we have giving
[TABLE]
From (12) it turns out that the value of must satisfy
[TABLE]
giving
[TABLE]
since .
From (8), we have . Therefore, we get
[TABLE]
i.e.,
[TABLE]
By plugging this value in , we get
[TABLE]
Note that if , we can assume giving as .
We claim that the bilinear form has maximum rank . Indeed, suppose there exists a nonzero such that . By plugging (13) in Equation (7) we get
[TABLE]
or, equivalently,
[TABLE]
where since either or if . Therefore, the following equation holds:
[TABLE]
given
[TABLE]
By subtracting Equation (14) from (15) multiplied by we get , a contradiction.
For every nonzero element , let
[TABLE]
Remark 2.11**.**
Note that the set is the -orbit of the bilinear form , with . It turns out that the bilinear forms in have constant rank.
By arguing similarly to the proof of Proposition 2.8 and Lemma 2.9, we get the following result.
Lemma 2.12**.**
Each set has size and if and only if .
We will write instead of , if is an element of with .
Lemma 2.13**.**
For any with not both zero, .
Proof.
The bilinear form , is equivalent to the bilinear form , with , via the automorphism . The result then follows from Remark 2.5 and Theorem 6.3 in [11].
Corollary 2.14**.**
Let be nonzero elements in . Then , for any and , with if a=b.
Lemma 2.15**.**
Let be distinct nonzero elements in . Then for any and .
Proof.
By Remark 2.7 we can assume with . By arguing as in the proof of Lemma 2.10 we see that the triple
[TABLE]
is a solution of the linear system
[TABLE]
for some linearly independent over with . Any solution of (17) satisfies
[TABLE]
where . Since we get giving . As a solution of (17), the triple (16) must satisfies giving either or , a contradiction.
Let and .
Lemma 2.16**.**
, for any , . Further, , for any and .
Proof.
The first part can be easily proved by taking the Dickson matrix with . The second part follows from Lemma 2.13.
Lemma 2.17**.**
Let . Then , for any and , .
Proof.
By Remark 2.7 we can assume with . Let . By proceeding as in the proof of Lemma 2.10 we see the pair is a solution of the linear system
[TABLE]
with . Then the above linear system has the unique solution giving and , a contradiction.
For , similar arguments lead to the same contradiction.
Lemma 2.18**.**
Let . Then , for any and , .
Proof.
Use Lemma 2.13.
Finally, we have the main theorem.
Theorem 2.19**.**
Let be a prime power and a positive integer. For any subset of , put , and set
[TABLE]
where is the zero ple. Then the subset of is a non-linear -MRD code.
Proof.
By Lemmas 2.9, 2.12 we get that has size . By Lemmas 2.10, 2.13, 2.15, 2.16, 2.17 and Corollary 2.14, we see that has minimum distance , i.e. it is a -MRD code. To show the non-linearity of , it suffices to find two distinct elements in it whose -span is not contained in .
Let and , . By corollary 2.3, we can work with the Dickson matrices and , or equivalently, with -ples and as arrays in . Let and . Suppose , for some . Then
[TABLE]
giving . Therefore, the subspace spanned by and meets trivially every if , or just in the 1-dimensional subspace spanned by if . The result then follows.
3 A geometric description for the non-linear MRD codes
For any , will denote the point of defined by via the canonical homomorphism . For any subset of , we set . The set is said to be an -linear set of rank if is an -dimensional -linear subspace of . An -linear set of rank is said to be scattered if the size of equals ; see [31] for more details on -linear sets and [27] for a relationship between linear MRD-codes and -linear sets.
Consider the set defined in Theorem 2.19 as a subset of , by setting , for any ; here, is the Singer basis of defined in Section 2. Therefore, is a scattered -linear set of rank of isomorphic to the projective space .
For any , the endomorphism
[TABLE]
maps into , with , and into , with .
Let be the span of and in . For any , is a scattered -linear set of rank of . In particular is a maximum scattered -linear set of pseudoregulus type of [24, 29].
Summarizing we have the following result.
Theorem 3.1**.**
Let be a prime power and a positive integer. Let be any nonempty subset of with . Then, the projective image of in is union of two points , mutually disjoint -dimensional -subgeometries , , and mutually disjoint -linear sets , of pseudoregulus type of rank contained in the line spanned by and .
We now investigate the geometry in of the projective set defined by each MRD code viewed as a subset of .
Let be the -span of and set . The rank of a vector by definition is the maximum number of linearly independent coordinates over .
If we consider as the -dimensional vector space , then every can be uniquely written as , with . Hence, can be viewed as , the tensor product of with itself, with basis . Elements of are called tensors and those of the form , with are called fundamental tensors. In , the set of fundamental tensors correspond to the Segre variety of [20].
Let be the map defined by
[TABLE]
with , . We call this map the *field reduction of * over with respect to the basis . The projective space is the the field reduction of over with respect to the basis .
Under the map , every 1-dimensional subspace of is mapped to the -dimensional -subspace of . It turns out that the set is a partition of the nonzero vectors of . In particular is a Desarguesian partition, i.e. the stabilizer of in contains a cyclic subgroup acting regularly on the components of [34], [14].
To any component of there corresponds a projective dimensional subspace of . The set is so called a Desarguesian spread of [34], [14].
In addition, the projective set of corresponding to the -image of the 1-dimensional subspaces spanned by non-zero vectors in is the Segre variety .
Let be the map defined by
[TABLE]
For every , the -th column of the matrix is the -ple of the coordinates of with respect to the basis of . From [16], the rank of equals the rank of , for all . In addition, the -image of fundamental tensors is precisely the set of rank 1 matrices.
Remark 3.2**.**
Evidently, is an isomorphism of rank metric spaces which also provides an isomorphism between the field reduction of with respect to and the metric space of all bilinear forms on .
Now embed into by extending the scalars from to . By taking a Singer basis of defined by the Singer cycle , Cooperstein [7] defined a cyclic model for within with basis , . Let
[TABLE]
where the subscript is taken modulo . As an -space, has dimension and by consideration on dimension we have
[TABLE]
see [7]. We call this representation the cyclic representation of the tensor product .
Proposition 3.3**.**
Let be the map defined by
[TABLE]
Then is linearly equivalent to in .
Proof.
Let be linear combination of vectors of rank 1, .
Let be the change of basis map of from the basis to the Singer basis .
Assume , i.e. , and set , , with . Therefore, and
[TABLE]
Now assume , . Set , , with . Therefore,
[TABLE]
giving .
On the other hand we have
[TABLE]
We call the map the *field reduction of * over with respect to the Singer basis and its image the cyclic model for the field reduction of over . The projective space whose points are the -dimensional subspaces generated by the elements of is the cyclic model for the field reduction of over .
Let be the map defined by
[TABLE]
Then, for any , the matrix is the Dickson matrix . Since the cyclic model for the field reduction of is obtained from the field reduction by changing a basis in , we get that the rank of equals the rank of , for any .
In addition, the element of the -partition is
[TABLE]
In particular, is the set of all rank 1 matrices in .
From the arguments above, we see that the set can be considered, via the isomorphism (3), as the field reduction of the set with respect to the Singer basis .
As , then the set defines the Segre variety of and defines a Segre variety projectively equivalent to under the element of corresponding to the linear transformation with .
Remark 3.4**.**
Note that, whenever , elements in have rank bigger then 1 by Lemma 2.10. This is explained by the fact that the linear transformation of corresponding to is not in .
Let . Then is a -dimensional vector subspace of . In , the set is the Bruck norm-surface
[TABLE]
introduced in [3] and widely investigated in [4, 5] and recently in [10, 23]. For any set . Then and the set is a so-called hyper-regulus of [30]. It turns out, that under the linear transformation with , also defines a hyper-regulus of .
The following result, which summarizes all above arguments, gives a geometric description of the MRD codes .
Theorem 3.5**.**
Let be a prime power and a positive integer. Let be any nonempty subset of with . The projective image of the MRD code in is a subset of a Desarguesian spread which is union of two spread elements, mutually disjoint Segre varieties and mutually disjoint hypereguli all contained in the -dimensional projective subspace generated by the two spread elements.
4 The Cossidente-Marino-Pavese non-linear MRD code
Recently, Cossidente, Marino and Pavese constructed non-linear -MRD codesin a totally geometric setting [8, Theorem 3.6].
In , , let be the set of points whose coordinates satisfy the equation , that is a -set of as introduced and studied in [13]. The set is the projective image of a subset of which is the union of , and the sets , with a nonzero element of .
For any nonzero , let with and set . Let be any non-empty subset of and put
[TABLE]
Up to an endomorphism of viewed as the vector space , the image of set under is a non-linear -MRD code [8, Proposition 3.8].
Lemma 4.1**.**
Let be the semilinear transformation of defined by
[TABLE]
with associated automorphism . Then maps into and into , for any nonzero element of .
Proof.
Every element with can be written as for some and a fixed element in such that . By straightforward calculations, we can write . Then, we get as .
The last part of the statement follows from straightforward calculations.
Corollary 4.2**.**
Let be any non-empty subset of and put . Then, up to the endomorphism of and the changing of basis in from to , the Cossidente-Marino-Pavese family of non-linear MRD codes is the set .
Let be any line of disjoint from a subgeometry . The set of points of that lie on some proper subspace spanned by points of is called the exterior splash of on [25].
Proposition 4.3**.**
[10]** The exterior splash of the subgeometry on the line is the set with .
Proof.
First we note that is disjoint from . The -span of some hyperplane in the cyclic model of is a hyperplane of with equation , for some nonzero. As the Singer cycle acts on the hyperplanes of by mapping the hyperplane with equation to the hyperplane with equation , then maps the hyperplane of with equation into the hyperplane with equation . Note that fixes .
The hyperplane of meets in the -subspace spanned by . By looking at the action of the Singer cyclic group on , we see that the exterior splash of on is the set . By using he map defined above with , we get the result.
Remark 4.4**.**
Let be the -span of and in . It is evident that the semilinear transformation maps the exterior splash of on into the exterior splash of on .
The exterior splash of on is
[TABLE]
In [8], the splash of was erroneusly given as the set . Note that, never coincides with , unless .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. Augot, P. Loidreau, G. Robert, Rank metric and Gabidulin codes in characteristic zero, Proceedings ISIT 2013 , 509–513.
- 2[2] L. Bader, G. Lunardon, Some remarks on the Spin Module Representation of Sp 6 ( 2 e ) subscript Sp 6 superscript 2 𝑒 {\rm Sp}_{6}(2^{e}) , Discrete Math. 339 (2016), 1265–1273.
- 3[3] R.H. Bruck, Construction problems of finite projective planes, in: Proc. Conf. on Combinatorics, University of North Carolina at Chapell Hill, April 10–14, 1967, University of North Carolina Press, Chapel Hill, 1969, pp. 426–514.
- 4[4] R.H. Bruck, Circle geometry in higher dimensions. II. Geometriae Dedicata 2 (1973), 133–188.
- 5[5] R.H. Bruck, The automorphism group of a circle geometry, J. Combin. Theory Ser. A 32 (1982), 256–263.
- 6[6] L. Carliz, A Note on the Betti-Mathieu group, Portugaliae mathematica 22 (3) (1963), 121–125.
- 7[7] B.N. Cooperstein, External flats to varieties in PG ( M n , n GF ( q ) ) PG subscript 𝑀 𝑛 𝑛 GF 𝑞 {\rm PG}(M_{n,n}{\rm GF}(q)) , Linear Algebra Appl. 267 (1997), 175–186.
- 8[8] A. Cossidente, G. Marino, F. Pavese, Non-linear maximum rank distance codes, Des. Codes Cryptogr. , 79 (3) (2016), 597- 609.
