相关论文: Cayley-Bacharach and evaluation codes on complete …
In this paper we give lower bounds for the minimum distance of evaluation codes constructed from complete intersections in toric varieties. This generalizes the results of Gold-Little-Schenck and Ballico-Fontanari who considered evaluation…
In this paper, we examine linear conditions on finite sets of points in projective space implied by the Cayley-Bacharach condition. In particular, by bounding the number of points satisfying the Cayley-Bacharach condition, we force them to…
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann--Tzeng (HT) bound is formulated…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
We prove a Cayley-Bacharach-type theorem for points in projective space $\mathbb{P}^n$ that lie on a complete intersection of $n$ hypersurfaces. This is made possible by new bounds on the growth of the Hilbert function of almost complete…
A new approach to bound the minimum distance of $q$-ary cyclic codes is presented. The connection to the BCH and the Hartmann--Tzeng bound is formulated and it is shown that for several cases an improvement is achieved. We associate a…
A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special…
The purpose of this paper is to show that for a complete intersection curve $C$ in projective space (other than a few stated exceptions), any morphism $f: C \to \mathbb{P}^r$ satisfying $\text{deg}\, f^*\mathcal{O}_{\mathbb{P}^r}(1)…
Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…
We study the algebraic geometry of a family of evaluation codes from plane smooth curves defined over any field. In particular, we provide a cohomological characterization of their dual minimum distance. After having discussed some general…
A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends…
We use a map to quantum error-correcting codes and a subspace projection to get lower bounds for minimal homological distances in a tensor product of two chain complexes of vector spaces over a finite field. Homology groups of such a…
Toric codes are evaluation codes obtained from an integral convex polytope $P \subset \R^n$ and finite field $\F_q$. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently by J. Hansen and D. Joyner.…
We introduce a new variant of quantitative Helly-type theorems: the minimal \emph{"homothetic distance"} of the intersection of a family of convex sets to the intersection of a subfamily of a fixed size. As an application, we establish the…
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…
From a rational convex polytope of dimension $r\ge 2$ J.P. Hansen constructed an error correcting code of length $n=(q-1)^r$ over the finite field $\fq$. A rational convex polytope is the same datum as a normal toric variety and a Cartier…
There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…
The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the…
Collision detection is a critical functionality for robotics. The degree to which objects collide cannot be represented as a continuously differentiable function for any shapes other than spheres. This paper proposes a framework for…
Let $P$ be a set of points in general position in the plane. Join all pairs of points in $P$ with straight line segments. The number of segment-crossings in such a drawing, denoted by $\crg(P)$, is the \emph{rectilinear crossing number} of…