Related papers: Linear sets on the projective line with complement…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
Bonini, Borello and Byrne started the study of saturating linear sets in Desarguesian projective spaces, in connection with the covering problem in the rank metric. In this paper we study \emph{$1$-saturating} linear sets in PG$(2,q^4)$,…
We construct a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. The results show that they are at most three-weight codes and they are suitable for applications…
In this work, we introduce $(r,i)$-regular fat linear sets, which are defined as linear sets containing exactly $r$ points of weight $i$ and all other points of weight one. This notion generalizes and unifies existing constructions;…
Fourier series in orthogonal polynomials with respect to a measure $\nu$ on $[-1,1]$ are studied when $\nu$ is a linear combination of a generalized Jacobi weight and finitely many Dirac deltas in $[-1,1]$. We prove some weighted norm…
Certain types of bilinearly defined sets in $\mathbb{R}^n$ exhibit a higher degree of linearity than what is apparent by inspection.
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…
Using linear projections one gets new inequalities for the successive minima of the lattice of sections of an hermitian line bundle on an arithmetic surface.
In this paper, we study one-Lee weight and two-Lee weight codes over $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$, where $u^{2}=0$. Some properties of one-Lee weight $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-additive codes are given, and a complete…
We study equi-singular strata of plane curves with two singular points of prescribed types. The method of the previous work [Kerner06] is generalized to this case. In particular we consider the enumerative problem for plane curves with two…
We study values of generalized polylogarithms at various points and relationships among them. Polylogarithms of small weight at the points 1/2 and -1 are completely investigated. We formulate a conjecture about the structure of the linear…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically…
A linear system is a pair $(X,\mathcal{F})$ where $\mathcal{F}$ is a finite family of subsets on a ground set $X$, and it satisfies that $|A\cap B|\leq 1$ for every pair of distinct subsets $A,B \in \mathcal{F}$. As an example of a linear…
We discuss representations of the projective line over a ring $R$ with 1 in a projective space over some (not necessarily commutative) field $K$. Such a representation is based upon a $(K,R)$-bimodule $U$. The points of the projective line…
Linear codes with a few weights have wide applications in information security, data storage systems, consuming electronics and communication systems. Construction of the linear codes with a few weights and determination of their parameters…
We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…
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…
In this paper, we first introduce the notion of generalized pair weights of an $[n, k]$-linear code over the finite field $\mathbb{F}_q$ and the notion of pair $r$-equiweight codes, where $1\le r\le k-1$. Some basic properties of…
The linearizability of differential equations was first considered by Lie for scalar second order semi-linear ordinary differential equations. Since then there has been considerable work done on the algebraic classification of linearizable…