Search for: All records

Abstract Datta and Johnsen (Des Codes Cryptogr 91:747–761, 2023) introduced a new family of evaluation codes in an affine space of dimension$$\ge 2$$ $\ge 2$over a finite field$${\mathbb {F}}_q$$ $F_q$where linear combinations of elementary symmetric polynomials are evaluated on the set of all points with pairwise distinct coordinates. In this paper, we propose a generalization by taking low dimensional linear systems of symmetric polynomials. Computation for small values of$$q=7,9$$ $q=7,9$shows that carefully chosen generalized Datta–Johnsen codes$$\left[ \frac{1}{2}q(q-1),3,d\right] $$ $\left(\frac{1}{2},q,(q-1),,,3,,,d\right)$have minimum distancedequal to the optimal value minus 1. 

Abstract The geometric sieve for densities is a very convenient tool proposed by Poonen and Stoll (and independently by Ekedahl) to compute the density of a given subset of the integers. In this paper we provide an effective criterion to find all higher moments of the density (e.g. the mean, the variance) of a subset of a finite dimensional free module over the ring of algebraic integers of a number field. More precisely, we provide a geometric sieve that allows the computation of all higher moments corresponding to the density, over a general number fieldK. This work advances the understanding of geometric sieve for density computations in two ways: on one hand, it extends a result of Bright, Browning and Loughran, where they provide the geometric sieve for densities over number fields; on the other hand, it extends the recent result on a geometric sieve for expected values over the integers to both the ring of algebraic integers and to moments higher than the expected value. To show how effective and applicable our method is, we compute the density, mean and variance of Eisenstein polynomials and shifted Eisenstein polynomials over number fields. This extends (and fully covers) results in the literature that were obtained with ad-hoc methods. 

In this paper, we give constructions for infinite sequences of finite nonlinear locally recoverable codes [Formula: see text] over a product of finite fields arising from basis expansions in algebraic number fields. The codes in our sequences have increasing length and size, constant rate, fixed locality, and minimum distance going to infinity.