Related papers: Projective toric codes
The genus 0, fixed-domain log Gromov-Witten invariants of a smooth, projective toric variety X enumerate maps from a general pointed rational curve to a smooth, projective toric variety passing through the maximal number of general points…
In this paper we prove new lower bounds for the minimum distance of a toric surface code defined by a convex lattice polygon P. The bounds involve a geometric invariant L(P), called the full Minkowski length of P which can be easily…
A toric code, introduced by Hansen to extend the Reed-Solomon code as a $k$-dimensional subspace of $\mathbb{F}_q^n$, is determined by a toric variety or its associated integral convex polytope $P \subseteq [0,q-2]^n$, where $k=|P \cap…
A smooth $d$-dimensional projective variety $X$ can always be embedded into $2d+1$-dimensional space. In contrast, a singular variety may require an arbitrary large ambient space. If we relax our requirement and ask only that the map is…
The real solutions to a system of sparse polynomial equations may be realized as a fiber of a projection map from a toric variety. When the toric variety is orientable, the degree of this map is a lower bound for the number of real…
By analogy with algebraic geometry, we define a category of non-linear sheaves (quasi-coherent homotopy-sheaves of topological spaces) on projective toric varieties and prove a splitting result for its algebraic K-theory, generalising…
Entropic regularization is a method for large-scale linear programming. Geometrically, one traces intersections of the feasible polytope with scaled toric varieties, starting at the Birch point. We compare this to log-barrier methods, with…
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…
We analyze polarization-adjusted convolutional codes using the algebraic representation of polar and Reed-Muller codes. We define a large class of codes, called generalized polynomial polar codes which include PAC codes and Reverse PAC…
We introduce a collection of convex polytopes associated to a torus-equivariant vector bundle on a smooth complete toric variety. We show that the lattice points in these polytopes correspond to generators for the space of global sections…
We define a statistical measure of the typical size of short words in a linear code over a finite field. We prove that the dual toric codes coming from polytopes of degree one are characterized, among all dual toric codes, by being extremal…
We associate a geometric space to an arbitrary convex polytope. Our construction parallels the construction by D. Cox of a toric variety as a GIT quotient. The spaces that we obtain are endowed with a natural stratification and perfectly…
The projective space of order $n$ over a finite field $\F_q$ is a set of all subspaces of the vector space $\F_q^{n}$. In this work, we consider error-correcting codes in the projective space, focusing mainly on constant dimension codes. We…
We define a quasi--projective reduction of a complex algebraic variety $X$ to be a regular map from $X$ to a quasi--projective variety that is universal with respect to regular maps from $X$ to quasi--projective varieties. A toric…
We analyze integer linear programs which we obtain after discretizing two-dimensional subproblems arising from a trust-region algorithm for mixed integer optimal control problems with total variation regularization. We discuss NP-hardness…
The purpose of this paper is to compute the minimal fibering degree of an arbitrary projective toric variety. We prove that it equals the lattice width of the associated polytope. This gives a complete answer to a question asked in a recent…
Toric surface codes are a class of error-correcting codes coming from a lattice polytope defining a two-dimensional toric variety. Previous authors have mostly completed classifications of these toric surface codes with dimension up to $k =…
We derive formulas for the cd-index and the toric h-vector of a convex polytope P from a sweeping by a hyperplane. These arise from interpreting the corresponding S-shelling of the dual of P. We describe a partition of the faces of the…
Long quantum codes using projective Reed-Muller codes are constructed. Projective Reed-Muller codes are evaluation codes obtained by evaluating homogeneous polynomials at the projective space. We obtain asymmetric and symmetric quantum…
Toric codes are a type of evaluation codes introduced by J.P. Hansen in 2000. They are produced by evaluating (a vector space composed by) polynomials at the points of $(\mathbb{F}_q^*)^s$, the monomials of these polynomials being related…