Related papers: Cayley-Bacharach and evaluation codes on complete …
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…
On any proper convex domain in real projective space there exists a natural Riemannian metric, the Blaschke metric. On the other hand, distances between points can be measured in the Hilbert metric. Using techniques of optimal control, we…
We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We…
It is well-known that cyclic codes have efficient encoding and decoding algorithms. In recent years, antiprimitive BCH codes have attracted a lot of attention. The objective of this paper is to study BCH codes of this type over finite…
All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…
We study vector minimizers u of the Allen-Cahn functional with potentials possessing N global minima defined on bounded domains, with certain geometrical features and Dirichlet conditions on the boundary. We derive a sharp lower bound for…
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…
We obtain criteria for detecting complete intersections in projective varieties. Motivated by a conjecture of Hartshorne concerning subvarieties of projective spaces, we investigate situations when two-codimensional smooth subvarieties of…
The distribution for the minimum of Brownian motion or the Cauchy process is well-known using the reflection principle. Here we consider the problem of finding the sample-by-sample minimum, which we call the online minimum search. We…
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…
In this paper we prove under some simplifying hypotheses questions of Picoco and Levinson-Ullery on Cayley-Bacharach sets. Our results imply that, under suitable hypotheses Cayley-Bacharach sets lie on curves of low degree. We then use…
This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation…
We establish new general etale versions of theorems of Barth and Sommese. Respectively, we compute the lower etale cohomology of closed subvarieties of $P^N$ of small codimensions and of their preimages with respect to proper morphisms…
Spectral bounds on the minimum distance of quasi-twisted codes over finite fields are proposed, based on eigenvalues of polynomial matrices and the corresponding eigenspaces. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a way…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…
We develop quantitative algorithmic information bounds for orthogonal projections and distances in the plane. Under mild independence conditions, the distance $|x-y|$ and a projection coordinate $p_e x$ each retain at least half the…
Motivated by applications in combinatorial design theory and constructing LCD codes, C. Ding et al \cite{DLX} introduced cyclic codes $\mho(q,m,h)$ and $\bar\mho(q,m,h)$ over $\mathbb{F}_q$ as new generalization and version of the punctured…
Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…
This paper seeks to show that the beam screen of the LHC has an important effect on the electric field of the LHC beam, a few tens of sigmas away from its center. To do so, we develop two new methods for finding the effect of a complex…
Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $\rho$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of…