Abstract
We show that for every linear section of a Grassmannian over a finite field \({{\mathbb {F}}}_q\), in addition to the evaluation code associated to the \({{\mathbb {F}}}_q\)-rational points of the section, there exists a parity check code. Instances of these parity check codes are given by linear sections of the Schubert, Lagrangian–Grassmannian, Schubert’s unions, Schubert’s Lagrangian–Grassmannian, and Schubert’s Lagrangian–Grassmannian unions codes
Similar content being viewed by others
References
Carrillo-Pacheco, J., Zaldívar, F.: On Lagrangian–Grassmannian codes. Des. Codes Cryptogr. 60, 291–298 (2011)
Carrillo-Pacheco, J., Vega, G., Zaldívar, F.: The weight distribution of a family of Lagrangian--Grassmannian codes. In: El Hajji, Said (ed.) et al., Codes, cryptology, and information security. First international conference, C2SI 2015, Rabat, Morocco, May 26–28, 2015. Proceedings–in honor of Thierry Berger. Cham: Springer. Lect. Notes Comput. Sci. 9084, 240–246 (2015)
Carrillo-Pacheco, J., Zaldívar, F.: On Codes over FFN\((1, q)\)-projective varieties. Adv. Math. Commun. 10, 209–220 (2016)
Carrillo-Pacheco, J., Zaldívar, F.: Higher weights for the Lagrangian–Grassmannian codes. Bol. Soc. Mat. Mex. 25, 747–758 (2019)
Chen, H.: On the minimum distance of Schubert codes. IEEE Trans. Inform. Theory 46, 1535–1538 (2000)
Gallager, R.G.: Low Density Parity Check Codes. Monograph. MIT Press, Cambridge (2013).. (Retrieved August 7)
Ghorpade, S.R., Lachaud, G.: Higher Weights of Grassmann Codes, in Coding Theory, Cryptography and Related Areas, pp. 122–131. Springer, Berlin (2000)
Ghorpade, S.R., Lachaud, G.: Schubert varieties, linear codes and enumerative combinatorics. Finite Fields Appl. 11(4), 684–699 (2005)
Ghorpade, S.R., Lachaud, G.: Hyperplane sections of Grassmannians and the number of MDS linear codes. Finite Fields Appl. 7, 468–506 (2001)
Hana, G.-M.: Schubert unions and codes from-step flag varieties. In: Rodier, François (ed.) et al., Arithmetics, geometry and coding theory (AGCT 2005). Papers of the conference held at CIRM, Marseilles, France, September 26--30, 2005. Paris: Société mathématique de France. Séminaires et Congrès 21, 43–61 (2009)
Hansen, J.P., Johnsen, T., Ranestad, K.: Schubert unions in Grassmann varieties. Finite Fields Appl. 13, 738–750 (2007)
Ikeda, T.: Schubert classes in the equivariant cohomology of the Lagrangian Grassmannian. Adv. Math. 215, 1–23 (2007)
Kreuzer, M., Robbiano, L.: Computacional Commutative Algebra 1. Springer, Berlin (2000)
Nogin, D.Y.: Codes associated to Grassmannians. In: Pellikaan, R. (ed.) et al., Arithmetic, geometry, and coding theory. Proceedings of the international conference held at CIRM, Luminy, France, June 28–July 2, 1993. Berlin: Walter de Gruyter. 145–154 (1996)
Ryan, C.T.: An application of Grassmannian varieties to coding theory. Congr. Numer. 57, 257–271 (1987)
Ryan, C.T.: Projective codes based on Grassmann varieties. Congr. Numer. 57, 273–279 (1987)
Ryan, C.T., Ryan, K.M.: The minimum weight of Grassmannian codes \(C(k, n)\). Discrete Appl. Math. 28, 149–156 (1990)
Tsfasman, M.A., Vlăduţ, S.G.: Geometric approach to higher weights. IEEE Trans. Inform. Theory 41, 1564–1588 (1995)
Acknowledgements
We would like to thank the referees for their comments and suggestions that helped to improve the presentation. J. Carrillo-Pacheco work is supported by the Laboratorio de Cifrado y Codificación de la Información of the Universidad Autónoma de la Ciudad de México.
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
About this article
Cite this article
Carrillo-Pacheco, J., Zaldívar, F. Codes on linear sections of the Grassmannian. Bol. Soc. Mat. Mex. 27, 44 (2021). https://doi.org/10.1007/s40590-021-00351-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40590-021-00351-1
Keywords
- Algebraic geometry codes
- Grassmann codes
- Lagrangian–Grassmannian codes
- Schubert codes
- Parity check codes
- LDPC codes