Related papers: Multisets with few special directions and small we…
In this paper, we consider point sets of finite Desarguesian planes whose multisets of intersection numbers with lines is the same for all but one exceptional parallel class of lines. We call such sets regular of affine type. When the lines…
The minimum weight of the code generated by the incidence matrix of points versus lines in a projective plane has been known for over 50 years. Surprisingly, finding the minimum weight of the dual code of projective planes of non-prime…
We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight…
We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.
In this paper, we consider the affine variety codes obtained evaluating the polynomials $by=a_kx^k+\dots+a_1x+a_0$, $b,a_i\in\mathbb{F}_{q^r}$, at the affine $\F_{q^r}$-rational points of the Norm-Trace curve. In particular, we investigate…
In order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) decoding, it turns out to be necessary to know the minimal…
For any affine-variety code we show how to construct an ideal whose solutions correspond to codewords with any assigned weight. We classify completely the intersections of the Hermitian curve with lines and parabolas (in the…
Over the past few years, the codes $\mathcal{C}_{n-1}(n,q)$ arising from the incidence of points and hyperplanes in the projective space $\text{PG}(n,q)$ attracted a lot of attention. In particular, small weight codewords of…
In this paper, we study the p-ary linear code C(PG(n, q)), q = p^h, p prime, h >= 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n, q), and its dual code. We link the codewords of small…
Let $C_{n-1}(n,q)$ be the code arising from the incidence of points and hyperplanes in the Desarguesian projective space PG($n,q$). Recently, Polverino and Zullo proved that within this code, all non-zero code words of weight at most…
This paper is concerned with the affine-invariant ternary codes which are defined by Hermitian functions. We compute the incidence matrices of 2-designs that are supported by the minimum weight codewords of these ternary codes. The linear…
We study a new class of codes for Gaussian multi-terminal source and channel coding. These codes are designed using the statistical framework of high-dimensional linear regression and are called Sparse Superposition or Sparse Regression…
In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study…
The paper is devoted to a detailed self-contained exposition of a part of the theory of affine planes leading to a construction of affine (or, equivalently, projective) planes not satisfying the Desarques axiom. It is intended to complement…
The aim of this article is to give lower bounds on the parameters of algebraic geometric error-correcting codes constructed from projective bundles over Deligne--Lusztig surfaces. The methods based on an intensive use of the intersection…
In this paper, we prove a stability result on k mod p multisets of points in PG(2,q), q = p^h. The particular case k=0 is used to describe small weight codewords of the code generated by the lines of PG(2, q), as linear combination of few…
Intersecting codes are linear codes where every two nonzero codewords have non-trivially intersecting support. In this article we expand on the theory of this family of codes, by showing that nondegenerate intersecting codes correspond to…
Codes with various kinds of decipherability, weaker than the usual unique decipherability, have been studied since multiset decipherability was introduced in mid-1980s. We consider decipherability of directed figure codes, where directed…
There are many examples for point sets in finite geometry, which behave "almost regularly" in some (well-defined) sense, for instance they have "almost regular" line-intersection numbers. In this paper we investigate point sets of a…
We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…