Related papers: Hyperplane Sections of Determinantal Varieties ove…
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…
Consider a finite field $\mathbb{F}_q$ and positive integers $d,m,r$ with $1\leq r\leq \binom{m+d}{d}$. Let $S_d(m)$ be the $\mathbb{F}_q$ vector space of all homogeneous polynomials of degree $d$ in $X_0,\dots,X_m$. Let $e_r(d,m)$ be the…
This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the $q$-analogues of projective systems and blocking sets. We also illustrate how to associate a classical…
A linear code over $\mathbb{F}_q$ with the Hamming metric is called $\Delta$-divisible if the weights of all codewords are divisible by $\Delta$. They have been introduced by Harold Ward a few decades ago. Applications include subspace…
We show explicit estimates on the number of $q$--rational points of an $F_q$--definable affine absolutely irreducible variety of the algebraic closure of the finite field $F_q$ of $q$ elements. Our estimates for a hypersurface significantly…
We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…
We prove a uniform estimate of the number of points for difference algebraic varieties in finite difference fields in the spirit of Lang-Weil. More precisely, we give uniform lower and upper bounds for the number of rational points of a…
The determinantal variety $\Sigma_{pq}$ is defined to be the set of all $p\times q$ real matrices with $p\geq q$ whose ranks are strictly smaller than $q$. It is proved that $\Sigma_{pq}$ is a minimal cone in $\mathbb R^{pq}$ and all its…
Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random network coding. In this paper, we show that constant-rank codes are closely related to constant-dimension codes and…
Let $A$ be a simple algebra over a field $F$. Under a mild cardinality assumption on $F$, we determine the greatest possible dimension for an $F$-affine subspace of $A$ that is included in the group of units $A^\times$, and we describe the…
We give upper and lower bounds for the number of rational points on Prym varieties over finite fields. Moreover, we determine the exact maximum and minimum number of rational points on Prym varieties of dimension 2.
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…
We give an asymptotic formula for the number of $\mathbb{F}_{q}$-rational points over a fixed determinant moduli space of stable vector bundles of rank $r$ and degree $d$ over a smooth, projective curve $X$ of genus $g \geq 2$ defined over…
By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…
We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…
We comprehensively study weighted projective Reed-Muller (WPRM) codes on weighted projective planes $\mathbb{P}(1,a,b)$. We provide the universal Gr\"obner basis for the vanishing ideal of the set $Y$ of $\mathbb{F}_q$--rational points of…
We study determinantal varieties from conditional independence models with hidden variables, focusing on their irreducible decompositions, dimensions, degrees, and Gr\"obner bases. Each variety encodes a collection of matroids, whose flats…
In these notes we study hyperplane arrangements having at least one logarithmic derivation of degree two that is not a combination of degree one logarithmic derivations. It is well-known that if a hyperplane arrangement has a linear…
Hankel determinantal rings, i.e., determinantal rings defined by minors of Hankel matrices of indeterminates, arise as homogeneous coordinate rings of higher order secant varieties of rational normal curves; they may also be viewed as…