Toric surface codes and Minkowski length of polygons

DOI10.1137/080716554MaRDI QIDQ5189525zbMATH OpenOpenAlexFDO

Authors Ivan Soprunov, Evgenia Soprunova

Publication date 17 March 2010

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0802.2088

zbMATH Keywords

evaluation codesMinkowski sumtoric codes

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: 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 computed for any given P.

Recommendations

• Toric Surface Codes and Minkowski Sums
• Lattice polytopes in coding theory
• Bringing toric codes to the next dimension
• On the parameters of two special toric surface codes
• scientific article; zbMATH DE number 1461537

Cited in

(26)

• Enumeration of lattice 3-polytopes by their number of lattice points
• Toric varieties, Hirzebruch surfaces and error-correcting codes
• Minkowski length of 3D lattice polytopes
• Small polygons and toric codes
• On classification of toric surface codes of low dimension
• Coding theory package for Macaulay2
• Classifying toric surface codes of dimension 7
• Algebraic geometric codes on minimal Hirzebruch surfaces
• Toric codes and finite geometries
• Remarks on generalized toric codes
• On the parameters of two special toric surface codes
• Lattice polytopes in coding theory
• Side Lengths of Equiangular Polygons (as seen by a coding theorist)
• Codes from Surfaces with Small Picard Number
• Projective toric codes
• \(\mathbb{F}_q\)-zeros of sparse trivariate polynomials and toric 3-fold codes
• Secret sharing schemes with strong multiplication and a large number of players from toric varieties
• Toric Surface Codes and Minkowski Sums
• Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes
• On parameterized toric codes
• On good infinite families of toric codes or the lack thereof
• Toric code distances from terraced polytopes
• Eventual quasi-linearity of the Minkowski length
• Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
• Schnyder woods for higher genus triangulated surfaces, with applications to encoding
• Algebraic geometry codes from polyhedral divisors

This page was built for publication: Toric surface codes and Minkowski length of polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189525)