Toric surface codes and Minkowski length of polygons
classification
🧮 math.AG
math.CO
keywords
boundslengthminkowskisurfacetoriccalledcodecodes
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.