Related papers: Projective toric codes
An equivariant linear system on a toric variety is a linear system invariant under the torus action. We study the number of irreducible components of the complete intersection of general divisors from a fixed collection of equivariant…
Abstract polytopes are combinatorial objects that generalise geometric objects such as convex polytopes, maps on surfaces and tilings of the space. Chiral polytopes are those abstract polytopes that admit full combinatorial rotational…
This study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…
We give a local Euler-Maclaurin formula for rational convex polytopes in a rational euclidean space . For every affine rational polyhedral cone C in a rational euclidean space W, we construct a differential operator of infinite order D(C)…
Consider the problem of constructing an experimental design, optimal for estimating parameters of a given statistical model with respect to a chosen criterion. To address this problem, the literature usually provides a single solution.…
We study a geometric version of the dimension growth conjecture. While it is closely related in spirit to themes arising in geometric Manin's conjecture, it applies in greater generality and provides more uniform bounds. For an irreducible…
This note presents some new information on how the minimum distance of the generalized toric code corresponding to a fixed set of integer lattice points S in R^2 varies with the base field. The main results show that in some cases, over…
This paper is a general survey of literature on Goppa-type codes from higher dimensional algebraic varieties. The construction and several techniques for estimating the minimum distance are described first. Codes from various classes of…
Three-dimensional (3D) topological codes offer the advantage of supporting fault-tolerant implementations of non-Clifford gates, yet their performance against realistic noise remains largely unexplored. In this work, we focus on the…
Coding in the projective space has received recently a lot of attention due to its application in network coding. Reduced row echelon form of the linear subspaces and Ferrers diagram can play a key role for solving coding problems in the…
Let X \subset Proj(V) be a projective spherical G-variety, where V is a finite dimensional G-module and G = SP(2n, C). In this paper, we show that X can be deformed, by a flat deformation, to the toric variety corresponding to a convex…
The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…
We give an alternative proof of the formula for the minimum distance of a projective Reed-Muller code of an arbitrary order. It leads to a complete characterization of the minimum weight codewords of a projective Reed-Muller code. This is…
We study a tropical analogue of the projective dual variety of a hypersurface. When $X$ is a curve in $\mathbb{P}^2$ or a surface in $\mathbb{P}^3$, we provide an explicit description of $\text{Trop}(X^*)$ in terms of $\text{Trop}(X)$, as…
We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…
Let $L$ be an ample line bundle over a smooth projective toric surface $X$. Then $L$ corresponds to a very ample lattice polytope $P$ that encodes many geometric properties of $L$. In this article, by studying $P$, we will give some…
By solving a problem regarding polynomials in a quotient ring, we obtain the relative hull and the Hermitian hull of projective Reed-Muller codes over the projective plane. The dimension of the hull determines the minimum number of…
This work is a natural continuation of our previous work \cite{yz}. In this paper, we give a complete classification of toric surface codes of dimension less than or equal to 6, except a special pair, $C_{P_6^{(4)}}$ and $C_{P_6^{(5)}}$…
In this paper we illustrate an algorithmic procedure which allows to build projective wonderful models for the complement of a toric arrangement in a n-dimensional algebraic torus T. The main step of the construction is a combinatorial…
We study the problem of maximizing information divergence from a new perspective using logarithmic Voronoi polytopes. We show that for linear models, the maximum is always achieved at the boundary of the probability simplex. For toric…