Rank weights for arbitrary finite field extensions
Gr\'egory Berhuy, Jean Fasel, Odile Garotta

TL;DR
This paper investigates various definitions of generalized rank weights for arbitrary finite field extensions, proving their equivalence and extending known results from finite fields to more general cases.
Contribution
It introduces and proves the equivalence of multiple definitions of generalized rank weights for arbitrary finite field extensions, broadening the scope of previous finite field results.
Findings
All definitions of generalized rank weights coincide for arbitrary finite extensions.
The results generalize known finite field extension theorems.
Provides a unified framework for rank weights in general finite field extensions.
Abstract
In this paper, we study several definitions of generalized rank weights for arbitrary finite extensions of fields. We prove that all these definitions coincide, generalizing known results for extensions of finite fields.
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.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Algebraic Geometry and Number Theory
**Rank weights for arbitrary finite field extensions **
Grégory Berhuy
Jean Fasel
Odile Garotta
Abstract
In this paper, we study several definitions of generalized rank weights for arbitrary finite extensions of fields. We prove that all these definitions coincide, generalizing known results for extensions of finite fields.
Contents
- 1 Introduction
- 2 Basics on rank supports
- 3 The geometric viewpoint
- 4 A generalization of the Galois closure of a subspace
- 5 Generalized rank weights for finite extensions
1 Introduction
Rank metric codes were introduced by Gabidulin in [Gab85] as linear codes over a finite extension of a given finite field. Their application to network coding has recently induced a lot of theoretical research, and many notions in the theory for codes with the Hamming metric have found an equivalent for codes with the rank metric. One of these is the definition of the generalized Hamming weights associated to the Hamming distance of a code, which has given rise to several proposed definitions of the generalized rank weights of a rank metric code. The first definition was given by Kurihara-Matsumoto-Uyematsu [KMU13], an alternative one was proposed by Oggier-Sboui in [OS12], then Ducoat proved in [Duc15, Prop II1] the equivalence of the first definition with a refinement of the second. In [JP17], motivated by their interest in the -th generalized rank weight enumerator of a rank metric code, Jurrius-Pellikaan gave yet another definition of these weights. Moreover, they considered the general setting of finite Galois extensions, a study initiated by Augot-Loidreau-Robert in [ALR13]. They introduced the notion of rank support of a vector and of a code, proving for finite fields that, in case the length of the code is bounded by the degree of the extension, there exists a vector in the code which has same rank support as ([JP17, Proposition 3.6] ). This was a crucial step in showing the equivalence of all the proposed definitions in the case of finite fields ([JP17, 5.2]) and [JP17, Remark 3.7] raised the question of whether this statement holds more generally. To study the case of general Galois extensions, Jurrius-Pellikaan used the field trace and the Galois closure of a code and proved the equivalence of their definition with the one given by Kurihara-Matsumoto-Uyematsu. In the restricted case of cyclic extensions, they linked rank support and Galois closure and showed the equivalence of their definition with the refined definition of [Duc15], always under the hypothesis .
In this paper we positively answer the question of generalizing [JP17, 3.6] for any finite extension (Theorem 3.1).
Theorem**.**
Let be a finite field extension of degree and let be a linear subspace. If , then there exists such that
[TABLE]
Moreover, we generalize the notion of the Galois closure of an -linear code to an arbitrary finite field extension (Definition 4.4).
Definition**.**
Let be any field extension, and let For any -linear subspace of , we denote by the intersection of all -linear subspaces of extended from and containing .
We prove that coincides with the Galois closure of in case the field extension is Galois, using that for such an extension a linear code in is Galois invariant if and only if it has a basis in ([GP10]). This generalization of the Galois closure of an -linear code allows to consider the following definitions (again, for an arbitrary extension of fields).
Definition**.**
, following [JP17, Definition 2.5] 2. 2.
, following [KMU13, Definition 5] 3. 3.
, following [OS12] 4. 4.
, following [Duc15].
In this setting, we finally present a unified proof of the equivalence of all proposed definitions of generalized rank weights (Theorem 3.1).
Theorem**.**
Let be a finite extension of degree , let be an integer such that and let be an -linear subspace of . Then the above four definitions coincide.
The paper is organized as follows. Section 2 presents basic results on rank supports and their relations with the restriction of a code. In particular, Proposition 2.11 may be seen as a generalization of the well-known result of Delsarte [Del75, Theorem 2] to arbitrary finite extensions. Section 3 is devoted to giving a geometric proof of Theorem 3.1. We warn the reader that this section involves some algebraic geometry, and in particular the notion of Weil restriction. In section 4 we present our generalization of the notion of Galois closure of an -linear code for arbitrary field extensions (Definition 4.4). We show that our closure has nice properties, in particular we prove in Proposition 4.7 that for finite extensions it is precisely the -extension of the rank support, thus generalizing the Galois case [JP17, 5.5]. In section 5, we use this proposition and Theorem 3.1 to prove the equivalence of all four (extended) definitions of the -th generalized rank weights (under the hypothesis ), in the setting of arbitrary finite extensions (Theorem 5.3).
Acknowledgments
The authors warmly thank Frédérique Oggier for a gentle introduction to rank metric codes and to the paper [JP17].
2 Basics on rank supports
Let be a finite field extension and let . Given an -linear subspace of , we define (following [GP10]) its restriction as the -linear subspace of . Given a -linear subspace of , we let denote the -linear subspace of generated by . Note that is canonically isomorphic to . If is a -linear map, we denote by the -linear map .
Let and let be a -basis of . For any -tuple , we may write and obtain a matrix .
The definitions of rank supports of a vector and of a subspace of were introduced by Jurrius and Pellikaan [JP17].
Definition 2.1**.**
- a)
For any , we call rank support of the subspace of generated by the rows of and write it . Its dimension is the rank weight of , denoted by .
- b)
Let be an -linear subspace. We call rank support of the -linear subspace
[TABLE]
and write it . Its dimension is the rank weight of , denoted by .
- c)
The rank distance of an -linear subspace of is the minimum rank of a matrix , for nonzero in . That is, we have .
We now state some basic properties of rank supports.
Proposition 2.2**.**
Let , , let and let be an -linear subspace of . Then
* does not depend on the choice of the -basis of .* 2. 2.
. 3. 3.
. 4. 4.
If generate as an -linear space, then is the -linear sum of the , . 5. 5.
Suppose . Then if and only if there exists such that . In that case we have . 6. 6.
* has rank distance if and only if . * 7. 7.
We have the inclusion of -subspaces . 8. 8.
We have the inclusion of -subspaces .
Proof.
Properties 1-4 are proved in [JP17, §2.3]. Let us prove statement 5 : we may assume that the first vector of our -basis of is . Then for any nonzero , all rows of are zero except the first one, which is the -tuple itself. We then get and . Thanks to statement 2, it remains to consider the situation when has rank one. In that case there exists an such that all rows of are colinear with the nonzero -th row : , , . We get , that is with the inverse of . So property 5 is proved. Since the rank distance of is the minimum rank weight of a nonzero vector in , it immediately yields statement 6. We turn to statement 7. If , we know from property 5 that . This gives the inclusion . Finally we prove statement 8. Using property 4, it suffices to consider the case where . So we need to prove that . But this is clear using the definition of . ∎
Proposition 2.3**.**
Let be a finite extension, let , and let be an -linear subspace. Then we have if and only if has a basis in or, equivalently, if and only if . In particular, we then have .
Proof.
Suppose that has a basis in . Statement 5 of Proposition 2.2 shows that (). Using statement 4 of the same proposition we see that the ’s generate . As , we get . We conclude that using statement 7 in the previous proposition.
Suppose conversely that and . Then . Let be a basis of . These vectors considered in are also independent over . We show that they generate over . Let . Then contains , so our hypothesis implies that . Using a -basis of the field , we can thus write as an -linear combination of vectors in , therefore also of the vectors . Thus is a basis of which is in . Clearly this is equivalent to having .
The last equality then follows using the fact that if has a basis in . ∎
We have the following general result.
Proposition 2.4**.**
Let be a finite extension of degree , and let . Let be an -linear subspace of of dimension and suppose that admits an -basis in . Then there exists such that .
Proof.
Let denote an - basis of in , with . From Proposition 2.3 we know that is spanned by . Let be a -basis of and set . Then and the matrix has the -tuples as its first rows, and its remaining rows are zero. So is spanned by and therefore equal to . ∎
Remark 2.5*.*
Note that since for all in , the hypothesis in Proposition 2.4 is necessary. Indeed, if admits a basis in , then has dimension by 2.3; see also Remark 4.8 for a stronger statement.
Recall that for any finite field extension , we have the (field) trace , which is -linear and non trivial in case is separable. We can extend this map to a trace map , which is the component-wise extension of the field trace.
Definition 2.6**.**
Let be a finite Galois extension with Galois group . The Galois closure of an -linear subspace of , denoted by , is the smallest subspace of that contains and is invariant under the component-wise action of on . The subspace is called Galois closed in case is -invariant, or equivalently in case .
The following result ([GP10, Theorem 1]) will play a crucial role in the sequel, notably in 4.3 when we set our generalized definition of the closure of .
Theorem 2.7**.**
If be a finite Galois extension and is an -linear subspace of then if and only if or, equivalently, if and only if admits a basis in .
For Galois extensions, Jurrius-Pellikaan have shown in [JP17, Theorem 4.3] that the rank support of a subspace of is equal to its image by . This actually holds (with same proof) for all separable finite extensions .
Theorem 2.8**.**
Suppose the finite field extension is separable and let . Then for any -linear subspace of , we have
Using this theorem we can generalize the setting of Theorem 9 in [GP10], which Giorgetti-Previtali have stated for Galois extensions (see 2.7).
Proposition 2.9**.**
Let be a finite separable extension and let be an -linear subspace of for some . Then we have if and only if admits a basis in .
Proof.
This follows from Proposition 2.3 combined with Theorem 2.8. ∎
We denote by the standard bilinear form on . Given any -linear subspace of , we define its orthogonal as the linear subspace
[TABLE]
Lemma 2.10**.**
Let be any field extension and let be an -linear subspace of for some . If admits a basis in , then so does .
Proof.
Let denote an - basis of in and let be the orthogonal of relative to the standard bilinear form on . Then is the intersection of the (), and has the same description over . Therefore . Since dimensions are the same we get , so comes from . ∎
For finite separable extensions, we know from Delsarte [Del75, Theorem 2] that , for any -linear subspace of Using Theorem 2.8, the following relation can be seen as a generalization of that equality to arbitrary finite extensions.
Proposition 2.11**.**
Let be a finite extension, let , and let be an -linear subspace of Then we have
[TABLE]
Proof.
We first show that . Take and . We have , where is a -basis of and the ’s belong to . We need to prove that all are zero. Indeed we have 0=\,\langle{\bf d},{\bf c}\rangle\,=\sum_{j=1}^{n}\bigl{(}\sum_{i=1}^{m}\alpha_{i}{d_{j}}^{(i)}c_{j}\bigr{)}=\sum_{i=1}^{m}\alpha_{i}\langle{\bf d}^{(i)},{\bf c}\rangle.
It now suffices to prove that . Let belong to and consider . As above, write , with all ’s in . Then we get . Therefore . Since the proof is complete. ∎
Remark 2.12*.*
In particular, the above proposition allows to compute the rank support of . Indeed, as , we get
[TABLE]
Finally we recover and complete the characterization of rank-degenerate codes given by Jurrius-Pellikaan in [JP17, Corollary 6.3]. Recall that these are the -linear subspaces of such that .
Corollary 2.13**.**
Let be a finite extension and let . A linear code in is degenerate with respect to the rank metric if and only if we have , or equivalently, if and only if .
Proof.
We apply statement 6 of Proposition 2.2 and combine it with Remark 2.12. ∎
3 The geometric viewpoint
In this section, we prove the following theorem, which is our first main result.
Theorem 3.1**.**
Let be a finite field extension of degree and let be a linear subspace. If , then there exists such that
[TABLE]
We start with a few observations allowing to reduce the problem to an algebro-geometric problem. First, we note that we can suppose that . Indeed, by Proposition 2.2, we have . We may therefore choose a basis of and work with this vector space instead of .
Lemma 3.2**.**
Let be a -linear subspace, and let be a linear map. Then
[TABLE]
Proof.
As , we have . Now, both terms are -linear subspaces of and it suffices to prove that if , then . Suppose then that and let . We can write as before
[TABLE]
with . By definition,
[TABLE]
and linear independence implies that for any . As is generated by the for , it follows that . ∎
Remark 3.3*.*
As a corollary, we see that if and only if , i.e. that
[TABLE]
In case , this yields that if and only if .
Proposition 3.4**.**
Let be a finite field extension of dimension and let . Let be a plane with . Then there exists such that
[TABLE]
for any -linear map .
The proof of Proposition 3.4 will be of geometric nature. Before starting with it, we first recall a few facts about the Weil restriction of quasi-projective schemes. If is a quasi-projective scheme over , then it Weil restriction along the field extension is the quasi-projective scheme over satisfying
[TABLE]
for any -algebra (its existence is given by [BLR90, §7.6] and [CGP15, Proposition A.5.8]). For instance, if , then as a direct computation shows (or [Poo17, §4.6]). In particular, we see that the Krull dimension of is . If , then [CGP15, Proposition A.5.9] shows that is connected and [CGP15, Proposition A.5.2] implies that an open immersion induces an open immersion . This shows that is of dimension . More generally, one can prove that the Weil restriction of a smooth quasi-projective scheme of (pure) dimension is of dimension but we don’t use this fact here.
The main ingredient of the proof of Proposition 3.4 is a morphism of schemes
[TABLE]
that we now define. Let be a finitely generated -algebra. Recall from [Gro61, Chapitre 4] that the set of points of is identified with a line bundle over and an equivalence class of surjections
[TABLE]
under the natural action of . To such a surjection, we can associate its kernel , which is a projective -module of rank . Extending scalars to , we obtain a projective -module which is a submodule of . We can then consider the intersection where is the plane in the problem.
Lemma 3.5**.**
The submodule is locally free of rank .
Proof.
It suffices to prove that for any maximal ideal of , the module is free of rank one after tensoring with . Now, is a finite field extension of , and thus of . By construction, and we have to compute the dimension of . As is of dimension and of dimension , the intersection can’t be trivial. Suppose that , i.e. that . This means that and then that . By Remark 3.3 this implies that , i.e. that , which is excluded. Thus, is locally free of rank . ∎
The lemma shows that the map
[TABLE]
is well-defined. To make it more explicit, we compute the image of a -point of . A representative of the equivalence class of linear maps associated to this point is
[TABLE]
given by . If with and is such that , we see that an element of the form is in the kernel of if and only if . It follows that
[TABLE]
We are now ready to prove Proposition 3.4. We observe first that a rational point of corresponds to a -point of , i.e. to a -linear subspace of , where is non trivial. This rational point is in the image if and only if there exists a surjection whose kernel has the property that , i.e. and . In view of Lemma 3.2, we see that a rational point is in the image of if and only if there exists a surjection such that . Thus, we see that a rational point of not in the image of satisfies the conclusion of Proposition 3.4 and it suffices to show that the morphism is not surjective on -points. Let be the closure of the image of . It is of dimension at most the dimension of , i.e. at most , while is of dimension . As , we see that is a proper closed subset of . If is infinite, it follows that there is a rational point in the open complement of and the result is proved. If is finite, we observe that has rational points. On the other hand, the (-)rational points of are in bijection with the ()-rational points of and it follows that there are such points. We conclude using the fact that
[TABLE]
∎
We now proceed with the proof of theorem 3.1.
proof of Theorem 3.1.
If is of dimension , then there is nothing to do. Suppose then that and that is a plane. As usual, we may assume that . By Proposition 3.4, there exists such that if and only if . If , there exists a non trivial linear form such that . By Lemma 3.2, this forces which contradicts the assumption on . So the theorem holds in this case.
To prove the general case, we now work by induction on the dimension of . We can write for some of dimension and some nontrivial . By induction, there exists such that . Now, is spanned by and , i.e. by and . By Proposition 2.2 we are thus reduced to considering and we can conclude using the case of a plane proved above. ∎
Remark 3.6*.*
In particular, taking shows that the condition is necessary in order for such an element to exist for any subspace of (indeed have rows); see also Remark 4.8.
Finally, recall from Corollary 2.13 that a code in is nondegenerate with respect to the rank metric if and only if . Theorem 3.1 thus yields the following equivalence :
Proposition 3.7**.**
Let be an extension of degree , and let be an -linear code of length which is nondegenerate with respect to the rank metric. Then there is a such that if and only if .
Proof.
Since matrices have rows, the equality forces . The converse is a special case of Theorem 3.1. ∎
4 A generalization of the Galois closure of a subspace
Definition 4.1**.**
Let by any field extension, and let We say that an -linear subspace of is extended from if is spanned by a family of vectors in . Equivalently, has a basis in , or else we have .
Lemma 4.2**.**
Let be any field extension, and let . If is a family of subspaces of extended from , then is extended from .
Proof.
For each , one may write , for some -linear subspace of , where the orthogonal is taken with respect to the standard -bilinear form on Indeed, is the orthogonal of , which by Lemma 2.10 is extended from .
Therefore, we have
[TABLE]
Thus, is extended from . ∎
Note that, given an -linear subspace of , there is at least one -linear subspace of extended from and containing , namely itself. Therefore, in view of lemma 4.2, the following statement makes sense.
Corollary 4.3**.**
Let be a finite Galois extension with Galois group , let , and let be an -linear subspace of Then is the intersection of all -linear subspaces of extended from and containing .
Proof.
Let be the intersection of all -linear subspaces of extended from and containing .
Since is an -linear subspace of extended from (by Theorem 2.7) and containing , we have . Conversely, we have by definition. Since is extended from (by Lemma 4.2), Theorem 2.7 shows that it is -invariant. By definition of , we get . ∎
This corollary motivates the following generalization of the definition of .
Definition 4.4**.**
Let be any field extension, and let For any -linear subspace of , we denote by the intersection of all -linear subspaces of extended from and containing .
It is the smallest -linear subspace of extended from and containing .
Remark 4.5*.*
If is a finite Galois extension, we recover the usual definition of , by Corollary 4.3. However, this generalization is more convenient, since its does not need the extension to be Galois. 2. 2.
The definition of immediately yields the following properties.
- (a)
for all -linear subspaces of , we have . 2. (b)
for all -linear subspaces of , we have if and only if is extended from . In particular, . 3. (c)
for all -linear subspaces of extended from such that , we have . 4. (d)
for all -linear subspaces of such that , we have .
Proposition 4.6**.**
Let be any field extension and let , be -linear subspaces of for some . Then we have .
Proof.
By Remark 4.5 the subspace contains both and , thus it contains their sum. Now combining Lemmas 2.10 and 4.2, we see that given two subspaces , of which are extended from , their sum also is extended from . Indeed, the orthogonal of is the intersection of and . Therefore is extended from . Since it contains , it also contains . ∎
Our next proposition generalizes Proposition 5.5 and Lemma 5.6 in [JP17]. In particular, it then follows from the first item in Remark 4.5 that their statements 5.5, 5.6 and 5.7 hold for any Galois extension, not necessarily cyclic.
Proposition 4.7**.**
Let be any finite extension and let be an -linear subspace of for some . Then
[TABLE]
In particular we have \,\dim C^{*}={\mathrm{wt}}_{R}(C),\ so that , and for any .
Proof.
We know from Proposition 2.2 that contains . Since it is also extended from , contains . Conversely, is included in , and since the subspace is extended from , we have (by Proposition 2.3). Whence is equal to . Now use that has dimension , and that . Finally we write our equality for and use statement 2 of 2.2. ∎
Remark 4.8*.*
The equality implies that the condition is necessary for the existence of an element such that . Indeed, if then its matrix has rows so that . In particular, the weaker condition is necessary. Note that, whereas we have shown in Proposition 2.4 that in case is extended from this last condition is also sufficient, in case is not extended from and such an element exists, we deduce from our Proposition that .
We give two corollaries to Proposition 4.7. Note that the second one admits an elementary proof, using the Galois group, in case the extension is Galois.
Corollary 4.9**.**
Let be a finite extension, let , let be an -linear subspace of and let . Then we have if and only if , that is, if and only if .
Proof.
Since and , both equalities are equivalent to the equality of the respective dimensions as and -subspaces. But Proposition 4.7 shows that the -dimension of is the same as the -dimension of , and similarly when replacing with .
Finally, if and , we deduce that by the second remark 4.5. ∎
Corollary 4.10**.**
Let be a finite extension, let and let be an -linear subspace of . Then . In particular if is separable, we have .
Proof.
Proposition 4.7 implies that the -subspaces and have the same dimension. Thus the obvious inclusion is an equality.
If is separable, Theorem 2.8 tells us that and coincide on -linear subspaces of , so the proof is complete. ∎
Finally, we slightly generalize Proposition 2.4, which similarly works even in case .
Lemma 4.11**.**
Let be a finite extension of degree , let , and let be an -linear subspace of such that . Suppose , where , and that there exists such that . Then there exists such that .
Proof.
Let denote a -basis of . We know from Proposition 2.2 that and that is thus the sum of and . If we are done, so we assume the contrary. Then the sum is direct, so that taking dimensions we get by Proposition 4.7 and . Thus one row of the matrix , say the last one, is a linear combination of the other ones. We change the vectors of the basis of by adding to each of them a vector , where is chosen so that, in the new basis of , the last row of the corresponding matrix is zero. We set so that we have . ∎
Corollary 4.12**.**
Let be a finite extension of degree , let , and let be an -linear subspace of such that . Suppose that is an -linear subspace such that , and that there exists such that . Then there exists such that .
Proof.
Let be vectors of which complete a basis of to an - basis of . We may repeatedly apply Lemma 4.11, taking successively . , . ∎
5 Generalized rank weights for finite extensions
We now set notation in order to discuss the various definitions of the generalized rank weights of a code and their equivalence. In what follows, we let be a finite extension of degree , and let . We let be a linear subspace of and let be an integer such that . Recall from Remark 4.5 that our definition 4.4 of generalizes the definition of Galois closure used in [JP17].
Notation 5.1**.**
We will denote by the maximum value .
Clearly we have , and equality holds if and only if there exists such that .
We now present, in the setting of an arbitrary finite extension, the various definitions which have been proposed for the -th generalized rank weight of . We insist that the star symbol used in definitions 2. and 4. refers to our definition 4.4, so that 2. and 4. are indeed generalized versions of the definitions considered in [JP17].
Definition 5.2**.**
, following [JP17, Definition 2.5] 2. 2.
, following [KMU13, Definition 5] 3. 3.
, following [OS12] 4. 4.
, following [Duc15].
Jurrius-Pellikaan have shown in [JP17, 4.4 and 5.4], that whenever is Galois. They also proved in [JP17, Theorem 5.8] that if and is cyclic, then .
Our main statement in this section is the following result.
Theorem 5.3**.**
Let be a finite extension of degree , let be an integer such that and let be an -linear subspace of Then all four definitions 5.2 coincide.
Proof.
Since , Theorem 3.1 implies that , for all subspaces of . This gives . To prove , we combine Theorem 3.1 with the fact that, by Corollary 4.10, and have the same rank support, and therefore .
Finally, the proof given in [JP17, 4.4 and 5.4] that whenever is Galois relies both on the equality , which we have proved in 4.7 in the setting of arbitrary finite extensions, and on the properties of and stated in the second remark 4.5. Thus this equality still holds in our setting. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[ALR 13] D. Augot, P. Loidreau, and G. Robert. Rank metric and Gabidulin codes in characteristic zero. In ISIT-2013 International Symposium on Information Theory , pages 509–513, 2013.
- 2[BLR 90] S. Bosch, W. Lütkebohmert, and M. Raynaud. Néron models . Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge. Band 21. A Series of Modern Surveys in Mathematics [Results in Mathematics and Related Areas. 3rd Series. A Series of Modern Surveys in Mathematics]. Springer-Verlag, Berlin-New York, 1990.
- 3[CGP 15] B. Conrad, O. Gabber, and G. Prasad. Pseudo-reductive Groups . New Mathematical Monographs. Cambridge University Press, Cambridge, 2015.
- 4[Del 75] P. Delsarte. On subfield codes of modified Reed-Solomon codes. IEEE Trans. Inform. Theory IT-21 , 5:575–576, 1975.
- 5[Duc 15] J. Ducoat. Generalized rank weights: a duality statement. In Topics in Finite fields , volume 632, pages 101–109. American Mathematical Society, 2015.
- 6[Gab 85] É. M. Gabidulin. Theory of codes of maximum rank distance. Problemy Peredachi Informatsii , 21(1):3–16, 1985.
- 7[GP 10] M. Giorgetti and A. Previtali. Galois invariance, trace codes and subfield codes. Finite Fields and Their Applications , 16:96–99, 2010.
- 8[Gro 61] Alexandre Grothendieck. Éléments de géométrie algèbrique: II. Étude globale élémentaire de quelques classes de morphismes. Publ. Math. Inst. Hautes Études Sci. , 8:5–222, 1961.
