相关论文: Cayley-Bacharach and evaluation codes on complete …

Given a 0-dimensional scheme X in a n-dimensional projective space P^n_K over an arbitrary field K, we use Liaison theory to characterize the Cayley-Bacharach property of X. Our result extends the result for sets of K-rational points given…

Given an ACM set $\mathbb{X}$ of points in a multiprojective space $\mathbb{P}^m\times\mathbb{P}^n$ over a field of characteristic zero, we are interested in studying the K\"ahler different and the Cayley-Bacharach property for…

We improve the best known lower bound for the dimension of radial projections of sets in the plane. We show that if $X,Y$ are Borel sets in $\R^2$, $X$ is not contained in any line and $\dim_H(X)>0$, then $$\sup\limits_{x\in X} \dim_H(\pi_x…

We first provide a stochastic formula for the Carath\'eodory distance in terms of general Markovian couplings and prove a comparison result between the Carath\'eodory distance and the complete K\"ahler metric with a negative lower curvature…

In this paper, we first study in detail the relationship between minimal linear codes and cutting blocking sets, which were recently introduced by Bonini and Borello, and then completely characterize minimal linear codes as cutting blocking…

In this paper we introduce a new type of code, called projective nested cartesian code. It is obtained by the evaluation of homogeneous polynomials of a fixed degree on a certain subset of $\mathbb{P}^n(\mathbb{F}_q)$, and they may be seen…

We examine an error-correcting coding framework in which each coded symbol is constrained to be a function of a fixed subset of the message symbols. With an eye toward distributed storage applications, we seek to design systematic codes…

The $p$-ary code associated with the incidence structure of points and $t$-spaces in a projective space $\mathrm{PG}(m,q)$, where $q=p^h$, is the $\mathbb{F}_p$-subspace generated by the incidence vectors of the blocks of this design. The…

It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…

In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence…

We observe that an interesting method to produce non-complete intersection subvarieties, the generalized complete intersections from L. Anderson and coworkers, can be understood and made explicit by using standard Cech cohomology machinery.…

Toric codes are a class of $m$-dimensional cyclic codes introduced recently by J. Hansen. They may be defined as evaluation codes obtained from monomials corresponding to integer lattice points in an integral convex polytope $P \subseteq…

We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by…

BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In the past sixty years, a lot of progress on the study of BCH codes has been made, but little is known about the properties of…

This paper establishes connections between the structure of a semigroup and the minimum spans of distance labellings of its Cayley graphs. We show that certain general restrictions on the minimum spans are equivalent to the semigroup being…

BCH codes form an important class of cyclic codes, which have applications in communication and data storage systems. Although the BCH bound provides a lower bound on the minimum distance of BCH codes, determining the true minimum distances…

For $d\in\{5,6\}$, we classify arrangements of $d + 2$ points in $\mathbf{RP}^{d-1}$ for which the minimum distance is as large as possible. To do so, we leverage ideas from matrix and convex analysis to determine the best possible codes…

We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…

We provide a unified analysis of a posteriori and a priori error bounds for a broad class of discontinuous Galerkin and $C^0$-IP finite element approximations of fully nonlinear second-order elliptic Hamilton--Jacobi--Bellman and Isaacs…

We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their…