Related papers: Projective toric codes
Toric codes are error-correcting codes that are derived from toric varieties, which hold a unique correspondence to integral convex polytopes. In this paper, we focus on integral convex polytopes $P \subseteq \mathbb{R}^2$ and the toric…
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…
A toric code is an error-correcting code determined by a toric variety or its associated integral convex polytope. We investigate $4$- and $5$-dimensional toric $3$-fold codes, which are codes arising from polytopes in $\mathbf{R}^3$ with…
Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an…
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…
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.…
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes. We show that the minimum distance is multiplicative with respect to taking the product of polytopes, and behaves…
Let $X_P$ be a smooth projective toric variety of dimension $n$ embedded in $\PP^r$ using all of the lattice points of the polytope $P$. We compute the dimension and degree of the secant variety $\Sec X_P$. We also give explicit formulas in…
We classify projective toric manifolds whose dual variety is not a hypersurface in the dual projective space. Under the standard dictionary between toric geometry and convex geometry, they correspond to certain convex Delzant integer…
Consider an n-dimensional projective toric variety X defined by a convex lattice polytope P. David Cox introduced the toric residue map given by a collection of n+1 divisors Z_0,...,Z_n on X. In the case when the Z_i are T-invariant…
Polynomial evaluation codes hold a prominent place in coding theory. In this work, we study the problem of list decoding for a general class of polynomial evaluation codes, also known as Toric codes, that are defined for any given convex…
We obtain certain algebraic invariants relevant to study codes on subgroups of weighted projective tori inside an $n$-dimensional weighted projective space. As application, we compute all the main parameters of generalized toric codes on…
Let $X_{P}$ be the projective toric surface associated to a lattice polytope $P$. If the number of lattice points lying on the boundary of $P$ is at least $4$, it is known that $X_{P}$ is embeddable into a suitable projective space as zero…
In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…
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…
A description of complete normal varieties with lower dimensional torus action has been given by Altmann, Hausen, and Suess, generalizing the theory of toric varieties. Considering the case where the acting torus T has codimension one, we…
Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this thesis we explore this correspondence to classify smooth lattice…
The Cox ring provides a coordinate system on a toric variety analogous to the homogeneous coordinate ring of projective space. Rational maps between projective spaces are described using polynomials in the coordinate ring, and we generalise…
We show that any smooth lattice polytope P with codegree greater or equal than (dim(P)+3)/2 (or equivalently, with degree smaller than dim(P)/2), defines a dual defective projective toric manifold. This implies that P is Q-normal (in the…
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…