Abstract
The aim of this article is to give lower bounds on the parameters of algebraic geometric error-correcting codes constructed from projective bundles over Deligne–Lusztig surfaces. The methods based on an intensive use of the intersection theory allow us to extend the codes previously constructed from higher-dimensional varieties, as well as those coming from curves. General bounds are obtained for the case of projective bundles of rank 2 over standard Deligne–Lusztig surfaces, and some explicit examples coming from surfaces of type and are given.
Keywords:
error-correcting codes; Deligne–Lusztig varieties; projective bundles; intersection theory MSC:
94B27; 14G50; 14C17; 14L35
1. Introduction
The theory of algebraic geometry codes arose in 1970, when V. Goppa discovered in [1] the relation between the theory of error-correcting codes and the evaluation on algebraic curves. They exhibited important properties that made researchers deepen their study. On the one hand, their good encoding–decoding algorithms led B. McEliece [2] to consider them for a public-key cryptosystem, which is considered by NIST as an alternative for the post-quantum era. On the other hand, M.A. Tsfasman et al. [3] were able to show that Goppa codes can be used to give examples of codes that go beyond the Gilbert–Varshamov bound. Since then, the interest in algebraic geometry has significantly increased. We can cite [4,5,6,7,8,9] as a few of the many existing examples of study over Hermitian, Castle, Suzuki or G-H curves.
But the definition of algebraic geometry codes can go beyond. Tsfasman and Vlǎdut̨, in [10], suggested that higher-dimensional varieties can be used to construct these type of codes, although the number of works in this sense does not equal that of the curves, probably due to the difficulty of finding higher-dimensional varieties X, spaces of functions L and sets of rational points , that can yield codes in the sense of Definition 2, which could be interesting due to their compelling properties concerning their weight distributions, minimum distance or fast encoding–decoding algorithms.The two-dimensional case has been relatively studied, like in the case of rational, hermitian or cubic surfaces, (cf. [11,12,13]).
However, this is not the case in general for higher-dimensional varieties. The survey by J. Little [14] offers a rather complete vision on the study of algebraic geometry codes defined over varieties in general. Among the referred papers, we can find the work by S. Hansen [15], wherein the author makes an extensive use of the intersection theory to develop their study. In this paper, some of the provided examples concern Deligne–Lusztig varieties, whose importance in algebraic geometry comes from the fact that they are directly linked to finite groups of Lie type. Moreover, these varieties are characterized by their large number of rational points, which allows for the definition of algebraic geometry codes, as we will see. In his paper, S. Hansen applies general methods to obtain lower bounds on the parameters of algebraic geometric error-correcting codes defined from varieties of greater dimension, as is the case of Deligne–Lusztig surfaces. Our aim in this paper is to go one step further [15] and study this kind of codes defined on projective bundles over Deligne–Lusztig surfaces. In order to obtain lower bounds on the associated parameters, we make an intensive use of the intersection theory and take advantage of the fact that, for some standard Deligne–Lusztig surfaces, all their rational points are distributed equally on the disjoint rational curves, constituting the irreducible components of a divisor . This allows us to give general bounds for the case of algebraic geometric error-correcting codes on projective bundles of rank 2 as well as some explicit examples coming from surfaces of type and .
2. Deligne–Lusztig Varieties
In this section, we shall define Deligne–Lusztig varieties and their compactification as well as study some of their main properties.
Let be a connected reductive algebraic group over an algebraically closed field k of positive characteristic p, equipped with an structure coming from a Frobenius morphism . Let be the corresponding Lang map taking an element to . By the Lang–Steinberg Theorem (see Theorem 4.4.17 in [16]), this morphism of varieties is surjective with finite fibers. From this result, it follows that, by conjugacy of Borel subgroups, there exists an stable Borel subgroup B. Let denote the quotient. There are then (with a slight abuse of notation) natural endomorphisms and of the Weyl group of G and the variety X of Borel subgroups of G. Let W be generated by the simple reflections , and let be the length function with respect to these generators.
Let us now recall from Definition 1 in [17] the following definition of Deligne–Lusztig variety.
Definition 1.
Fix an element w in the Weyl group W, and let be a reduced expression of w. Call w a Coxeter element if there in this expression occurs exactly one from each of the orbits of F on . Denote by δ the order of F on this set. Then, the Deligne–Lusztig variety is defined as the image of in . That is,
Next, we will follow the notation and definitions given in [17]. Define the closed subvariety of
In those cases wherein there is a unique product such that , we shall write for the variety . For any subset , defines in a natural way a closed subvariety of . In particular, there are divisors
Example 1.
Let us consider the Deligne–Lusztig surface of type . In this particular case, the connected reductive algebraic group is and the Frobenius map is given by
Moreover, the Weyl group W of G is isomorphic to the symmetric group of the three vectors in the base of , and , where corresponds to the permutation of the first and the second vectors of the base and corresponds to the permutation of the second and the third vector.
When G is semi-simple with connected Dynkin diagram D (with numbering of nodes and their associated simple reflections), there is a (unique) natural choice of Coxeter element: let with r maximal (under the condition that is not in the orbit of any of the previous , ). When choosing this particular Coxeter element, we shall refer to (or ) as being of standard type.
We claim that is of classical type if w is a Coxeter element for one of the following classical groups: or .
For , we shall say that and are conjugate if there exists such that . It is worth noting that w and are conjugate for any .
Since the morphism L is flat, it is open; hence, . Therefore, is a non-singular variety of dimension n and the closure of in X, , is given by the disjoint union
where, as usual, ≤ is the Bruhat order in W. This closure is usually singular whenever the Schubert variety is. But since the open subset
of the smooth projective variety maps isomorphically onto under projection to the first factor, we have a good compactification of . In fact, the complement of in , which is easily seen to be the union of the divisors defined above, is a divisor with normal crossings. If w is a Coxeter element, then and are irreducible and, in fact, is isomorphic to , and hence non-singular.
It is worth noting that it follows from Definition 1 that, if is of classical type, then the irreducible components of any Deligne–Lusztig subvariety of are of classical type too (see Remark 1 in [17]).
The following result allows us to consider the image of standard Deligne–Lusztig varieties under a certain proper morphism as a normal strict complete intersection in a certain projective space as well as to compute its Picard group.
Theorem 1
(Theorem 3 in [17]). Let be a standard Deligne–Lusztig variety of type , , , or . Assume that in the orthogonal cases. Let P be the parabolic subgroup generated by B together with the double cosets , and let
be the projection (projection to the first factor, followed by the quotient map). It is worth noting that the inclusion is an equality in the non-orthogonal cases. Denote by the dimensional linear subspace of obtained by setting the last coordinates as equal to zero.
- 1.
- The image is a normal, strict complete intersection. In fact, Lusztig shows (see pp. 444–445 in [18]) that Z equals the support of the scheme’s theoretic complete intersection , with mapping isomorphically onto the open subset of Z (see Table 2 in [17]). In the unitary and orthogonal cases, the singular locus of Z, consists of the finitely many translates of the closed subscheme . Hence,In the symplectic case, consists of the translates of the closed subscheme , and the previous formula becomes
- 2.
- For , and consequentlywhere H is the hyperplane section of Z, j is the obvious inclusion and is the set of indices , satisfying that some connected component of the Dynkin diagram corresponding to occurs as a subgraph of the Dynkin diagram corresponding to .
- 3.
- For any Coxeter element , we have
3. Error-Correcting Codes Construction
Tsfasman and Vlǎdut̨ introduced the following construction (generalizing the Goppa–Manin construction):
Definition 2
(H-construction p. 272 in [10]). Let X be a normal projective variety over . Let L be a line bundle defined over and let be distinct rational points on X. Set . In each , choose isomorphisms of the fibers with . The linear code of length n associated to is the image of the germ map
From now on, we assume that all line bundles considered actually have a non-zero global section.
Suppose L arises as the line bundle associated to a divisor D and that the are not in the support of D. Then, we obtain the same code (up to isomorphism) as when evaluating the rational functions
in the points .
The fundamental question is: Given a line bundle L on X, how many zeros does a section have along a fixed set of rational points?
Using the correspondence between line bundles and (Weil) divisors on a normal variety, we may reformulate the question as follows: For a fixed line bundle L, and given an effective divisor D such that , how many points from are in its support ?
Although in the particular case of , where the points happen to be divisors, one may apply the Riemann–Roch theorem to give a lower bound on d and a formula for k in higher dimensions; however, we have to face the task of comparing objects of different dimension. This may be remedied in two ways:
- Make the objects have the same codimension by blowing-up at the points;
- Make the objects have complementary dimensions, that is, make the points in some way into curves.
In the next section, we shall pursue the latter idea. In this case, the following result establishes a lower bound for the minimum distance.
Proposition 1
(Proposition 3.2 in [15]). Let X be a normal projective variety defined over of dimension at least two. Let be (irreducible) curves on X with rational points . Assume the number of rational points on rational is less than N. Let L be a line bundle on X, defined over , such that for all i. Let
Then, the code has length n and minimum distance
If for all i, then .
In particular, if X is a non-singular surface, we can cite the following corollary.
Corollary 1
(Corollary 3.2 in [15]). Assume furthermore that X is a non-singular surface and that H is a nef divisor on X with for all i. Then,
Consequently, if for all i, we have and
where .
4. Some EC-Codes on Projective Bundles over Standard Deligne–Lusztig Surfaces
This section is devoted to the computation of lower bounds for the parameters of certain error-correcting codes on projective bundles over standard Deligne–Lusztig surfaces.
Given a standard Deligne–Lusztig surface S of type or , for a suitable parabolic subgroup P of G we have a commutative diagram:
where
and with
if , i is an embedding, j is finite, is locally trivial (in the Zariski topology) and is birational and surjective; see Sects. 5,6,7,8 in [19].
Moreover, the surface S is isomorphic to the blow-up of (see Definition p. 163 in [20]) Z at a certain set of points in the cases , and all its rational points are distributed equally on the disjoint rational curves constituting the irreducible components of the divisor , whereas in the remaining case, , Z is obtained from S by contracting the disjoint hermitian curves constituting the irreducible components of the divisor and all the rational points of S are distributed equally on the disjoint rational curves constituting the irreducible components of the divisor .
The following theorem constitutes the main result of this paper, where explicit lower bounds for the parameters of a certain class of codes on projective bundles over Deligne–Lusztig surfaces are given.
Theorem 2.
Let S be a standard Deligne–Lusztig surface of type or , and let V be a vector bundle of rank 2 defined over S. Consider the projective bundle over S, that is . Then, for some , we can construct a code on T over with parameters.
- 1.
- ;
- 2.
- ;
- 3.
- if , and otherwise,
where
and denotes the first Chern class of the line subbundle of minimum degree of the restricted vector bundle over .
Proof.
We will consider to be the rational points on T. Let be the fibers over the rational points of S. These disjoint lines contain all rational points of T, that is,
It follows then that the length n of the code is
Let L be the line bundle over T. From Theorem 9.6 in [21] and Proposition II.7.11 in [20], it follows that
so when in the range wherein the bound on the minimum distance ensures the injectivity of the evaluation map, the dimension of the code is
Now, we will apply Proposition 1 in order to obtain the bound for the minimum distance. It is worth noting that, in the cases we are interested in, with , so the maximum number of rational points on will be . Moreover, by Lemma 9.7 in [21], we have that
From Equation (17), we know that . Now, is an irreducible component of , it is rational and will be isomorphic to the projective bundle , where denotes the closed embedding. As a consequence, by Theorem 9.6 in [21], the Chow ring of is isomorphic to
where is the hyperplane section in . It is worth noting that since is rational, then by Corollary V.2.14 in [20], , and we can always suppose that .
Now, if we restrict the line bundle L to , then . Let be a nef divisor on (see Theorem V.2.17 [20]). Then, since , it follows by Corollary 1 that
provided that , and otherwise. As , we can conclude the following bound for the minimum distance
if and
otherwise. □
Before computing the explicit parameters of some families of these codes, we need the following auxiliary result.
Lemma 1.
Let Y be a variety and a vector bundle of rank 2 over Y, that is, a direct sum of two line bundles and . Then, the symmetric algebra of V satisfies
Proof.
The first isomorphism is a consequence of the universal property for symmetric algebras, the second equality is just by definition and the last isomorphism follows from the fact that, for a line bundle , we have
□
The following corollaries give explicit bounds for the parameters of certain families of codes on projective bundles of rank 2 over Deligne-Lusztig surfaces of type and , obtained by restricting the previous results to certain vector bundles defined over them.
Corollary 2.
Let be the Deligne–Lusztig surface of type defined over the field . Consider some b, such that , and for , where , verifying, for any pair, with :
- 1.
- ;
- 2.
- ;
- 3.
- ;
- 4.
- .
Let be the projective bundle over , . Then, we can construct a code on over with parameters
- 1.
- 2.
- 3.
Proof.
Since is isomorphic to the blow-up of at the set of its rational points over (see Sect. 5 in [19]), we have that . Moreover, , so we can conclude that the length n of the code is
Let L be the line bundle . In order to compute the dimension of the code, we have , where . As a result of Lemma 1,
Now, global sections of a direct sum of line bundles satisfy
and finally, we can conclude
Furthermore, by the hypothesis of the theorem, is excellent with respect to the exceptional configuration of (see p. 215 in [22]), so if we denote , then by Theorem 1.1 in [22]:
This allows us to conclude that, when in the range wherein the bound on the minimum distance ensures the injectivity of the evaluation map, the dimension of the code is
Finally, by Proposition 9.4 in [21], any section of (recall that ) intersects a fiber in a hyperplane, so and we can conclude the following bound for the minimum distance:
□
Corollary 3.
Let be the Deligne–Lusztig surface of type defined over the field . Consider for , and let be the projective bundle over , . Then, for some and for any such that for any pair with , we can construct a code on over with parameters
- 1.
- ;
- 2.
- ;
- 3.
- .
Proof.
Since all the rational points of are distributed equally on the disjoint rational curves constituting the irreducible components of the divisor , then . Moreover, , so we can conclude that the length n of the code is
Let L be the line bundle . In order to compute the dimension of the code, we have that , with . As a result of Lemma 1
Now, global sections of a direct sum of line bundles satisfy
and since pull-back commutes with tensor product, it follows then that
Furthermore, as is birational onto Z, we obtain (see Theorem 2.31 in [23])
Since Z is the complete intersection of two hyper-surfaces of degrees and , respectively, we obtain short exact sequences of line bundles
and
(see Section 7.3 in [23]). These sequences give long exact sequences of cohomology groups,
and
By the formulas of Theorem III.5.1 in [20] for the cohomology of projective space, the first long exact sequence reduces (for any t) to
Hence, for any t, and
Consequently, for any , the last sequence then gives
so, when in the range wherein the bound on the minimum distance ensures the injectivity of the evaluation map, the dimension of the code is
Finally, by Proposition 9.4 in [21], any section of (recall that ) intersects in an hyperplane, so and we can conclude the following bound for the minimum distance:
□
Finally, we compute the parameters of some of the codes in Corollary 2 and Corollary 3 for the binary case, , as this is the most common finite field within applications.
Corollary 4.
Let be the Deligne–Lusztig surface of type defined over the field . Let us consider , with for and , and let be the projective bundle over , . Now, let L be the line bundle over , where , with , and for . Then, we can construct a code on over with parameters
- 1.
- ,
- 2.
- ,
- 3.
- .
Proof.
Let . Then, there exists an isomorphism . Now, let us consider the restriction . We know that . Moreover, let us consider the divisor that is nef by ([20], Chap. V.2). Then, by ([15], Corollary 3.2.), we know that
so, as a consequence of ([15], Proposition 3.2), it follows that
□
Corollary 5.
Let be the Deligne–Lusztig surface of type defined over the field . Let us consider , where , and let be the projective bundle over , . Now, let L be the line bundle over , with . Then, we can construct a code on over with parameters
- 1.
- ,
- 2.
- ,
- 3.
- .
Proof.
Let . Now, let us consider the restriction . Moreover, let us consider the divisor that is nef by ([20], Chap. V.2). Then by ([15], Corollary 3.2.) we know that
so, as a consequence of ([15], Proposition 3.2), it follows that
□
Example 2.
Let us consider the particular case , with , , , for , for and otherwise, for the family of codes presented in Corollary 4. Then, we obtain codes with the following parameters:
- 1.
- ,
- 2.
- ,
- 3.
- .
Example 3.
For , let us consider the particular case , , for the family of codes presented in Corollary 5. Then, we obtain a code with the following parameters:
- 1.
- ,
- 2.
- ,
- 3.
- .
Example 4.
Let us consider the particular case , with , , , for , for and otherwise, for the family of codes presented in Corollary 4. Then, we obtain codes with the following parameters:
- 1.
- ,
- 2.
- ,
- 3.
- .
5. Conclusions
By means of an intensive use of the intersection theory, we extend some of the previous results for codes over Deligne–Lusztig surfaces to the case of codes on projective bundles of rank 2 over standard Deligne–Lusztig surfaces. In particular, we compute the length, dimension and give a lower bound for the minimum distance in Theorem 2 for the cases of codes on projective bundles over Deligne–Lusztig surfaces of type or . Moreover, in Corollary 2 and Corollary 3, we focus on some special families of these codes, by restricting our results to certain vector bundles over Deligne–Lusztig surfaces of type and , in order to give a more explicit computation of their dimension. Finally, we give two examples of binary codes, as seen in Example 2 and Example 3, motivated by the fact that is the most common framework within applications. In Example 2, we obtain an information rate and an error-correcting rate , and in Example 3 we obtain an information rate and an error-correcting rate , concluding that both codes exhibit high error-correcting rates.
Some interesting problems would be to extend these results to the case of projective bundles of higher rank over standard Deligne–Lusztig surfaces following the techniques used in [24], and to establish a more explicit understanding on how the morphism of Theorem 1 behaves for Deligne–Lusztig varieties of dimension in order to construct new algebraic geometric error-correcting codes over them.
Author Contributions
Writing—original draft, D.C.P. and J.A.L.R. All authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.
Funding
The first author was supported by Ministerio de Ciencia e Innovación PGC2018-096446-B-C21, and the second author is supported by FQM 0211 Junta de Andalucía and Ministerio de Ciencia e Innovación PID2020-113552GB-I00.
Data Availability Statement
No new data were created or analyzed in this study. Data sharing is not applicable to this article.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Goppa, V.D. A new class of linear error-correcting codes. Probl. Inf. Transm. 1970, 6, 300–304. [Google Scholar]
- McEliece, R.J. A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. Jet Propuls. Lab. Pasadena 1978, 42, 114–116. [Google Scholar]
- Tsfasman, M.A.; Vladut, S.G.; Zink, T. Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound. Math. Nachr. 1982, 109, 21–28. [Google Scholar] [CrossRef]
- Barelli, E.; Beelen, P.; Datta, M.; Neiger, V.; Rosenkilde, J. Two-point codes for the generalized GK curve. IEEE Trans. Inform. Theory 2008, 64, 6268–6276. [Google Scholar] [CrossRef]
- Christensen, R.B.; Munuera, C.; Pereira, F.; Ruano, D. An algorithmic approach to entanglement-assisted quantum error-correcting codes from the Hermitian curve. Adv. Math. Commun. 2023, 17, 78–97. [Google Scholar] [CrossRef]
- Hansen, J.P.; Stichtenoth, H. Group codes on certain algebraic curves with many rational points. Appl. Algebra Engrg. Comm. Comput. 1990, 1, 67–77. [Google Scholar] [CrossRef]
- XXing, C.; Chen, H. Improvements on parameters of one-point AG codes from Hermitian curves. IEEE Trans. Inform. Theory 2002, 48, 535–537. [Google Scholar] [CrossRef]
- Munuera, C.; Sepúlveda, A.; Torres, F. Algebraic Geometry codes from Castle curves. In Coding Theory and Applications. Lecture Notes in Computer Science; Barbero, A., Ed.; Springer: Berlin/Heidelberg, Germany, 2008; pp. 117–127. [Google Scholar]
- Stichtenoth, H. A note on Hermitian codes over GF(q2). IEEE Trans. Inf. Theory 1988, 34, 1345–1348. [Google Scholar] [CrossRef]
- Tsfasman, M.A.; Vladut, S.G. Algebraic-Geometric Codes, 3rd ed.; Springer Kluwer: Dordrecht, The Netherlands, 1991. [Google Scholar]
- Couvreur, A. Construction of rational surfaces yielding good codes. Finite Fields Appl. 2011, 17, 424–441. [Google Scholar] [CrossRef]
- Edokou, F. Codes defined by forms of degree 2 on hermitian surfaces and Srensen’s conjecture. Finite Fields Appl. 2007, 13, 616–627. [Google Scholar] [CrossRef]
- Voloch, J.F. Algebraic geometric codes on surfaces. In Arithmetics, Geometry, and Coding Theory (AGCT 2005); Volume 21; Séminaires et Congrès-Société Mathématique de France: Paris, France, 2010; pp. 211–216. [Google Scholar]
- Little, J.B. Algebraic geometry codes from higher dimensional varieties. In Advances in Algebraic Geometry Codes; Serie Coding Theory Cryptology; Martinez-Moro, E., Munuera, C., Ruano, D., Eds.; World Scientific Publishing: Hackensack, NJ, USA, 2008; Volume 5, pp. 257–293. [Google Scholar]
- Hansen, S.H. Error-correcting codes from higher-dimensional varieties. Finite Fields Appl. 2001, 7, 531–552. [Google Scholar] [CrossRef]
- Springer, T.A. Linear Algebraic Groups; Birkhäuser Boston: Boston, MA, USA, 1998. [Google Scholar]
- Hansen, S.H. Picard groups of Deligne-Lusztig varieties—With a view toward higher codimensions. Beiträge Algebra Geom. 2002, 43, 9–26. [Google Scholar]
- Lusztig, G. On the Green polynomials of classical groups. Proc. Lond. Math. Soc. 1976, 33, 443–475. [Google Scholar] [CrossRef]
- Rodier, F. Nombre de points des surfaces de Deligne et Lusztig. J. Algebra 2000, 227, 706–766. [Google Scholar] [CrossRef]
- Hartshorne, R. Algebraic Geometry; Springer: New York, NY, USA; Heidelberg, Germany, 1977. [Google Scholar]
- Eisenbud, D.; Harris, J. 3264 and All That—A Second Course in Algebraic Geometry; Cambridge University Press: Cambridge, UK, 2016. [Google Scholar]
- Harbourne, B. Complete linear systems on rational surfaces. Trans. Amer. Math. Soc. 1985, 289, 213–226. [Google Scholar] [CrossRef]
- Iitaka, S. Algebraic Geometry. An Introduction to Birational Geometry of Algebraic Varieties; Springer: New York, NY, USA; Berlin, Germany, 1982. [Google Scholar]
- Nakashima, T. Error-correcting codes on projective bundles. Finite Fields Appl. 2006, 12, 222–231. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).