The weight distribution of a family of Lagrangian-Grassmannian codes

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Using Plücker coordinates we construct a matrix whose columns parametrize all projective isotropic lines in a symplectic space E of dimension 4 over a finite field (image Found)q. As an application of this construction we explicitly obtain the smallest subfamily of algebro-geometric codes defined by the corresponding Lagrangian-Grassmannian variety. Furthermore, we show that this subfamily is a class of three-weight linear codes over (image Found)q of length (q4 −1)/(q −1), dimension 5, and minimum Hamming distance q3 − q.

Cite

CITATION STYLE

APA

Carrillo-Pacheco, J., Vega, G., & Zaldívar, F. (2015). The weight distribution of a family of Lagrangian-Grassmannian codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9084, pp. 240–246). Springer Verlag. https://doi.org/10.1007/978-3-319-18681-8_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free