Hyperplane Sections of Determinantal Varieties over Finite Fields and Linear Codes
Combinatorics
2018-09-14 v1 Information Theory
Algebraic Geometry
math.IT
Abstract
We determine the number of -rational points of hyperplane sections of classical determinantal varieties defined by the vanishing of minors of a fixed size of a generic matrix, and identify sections giving the maximum number of -rational points. Further we consider similar questions for sections by linear subvarieties of a fixed codimension in the ambient projective space. This is closely related to the study of linear codes associated to determinantal varieties, and the determination of their weight distribution, minimum distance and generalized Hamming weights. The previously known results about these are generalized and expanded significantly
Cite
@article{arxiv.1809.04690,
title = {Hyperplane Sections of Determinantal Varieties over Finite Fields and Linear Codes},
author = {Peter Beelen and Sudhir R. Ghorpade},
journal= {arXiv preprint arXiv:1809.04690},
year = {2018}
}
Comments
17 pages