Toric surface codes and Minkowski length of polygons
arXiv:0802.2088 · doi:10.1137/080716554
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.
18 pages, 9 figures
Cited by in corpus (15)
- Coding theory package for Macaulay2
- Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
- Toric complete intersection codes
- Enumeration of lattice 3-polytopes by their number of lattice points
- Bringing Toric Codes to the next dimension
- Multigraded Hilbert function and toric complete intersection codes
- Minkowski length of 3D lattice polytopes
- AG Codes from Polyhedral Divisors
- Remarks on generalized toric codes
- On Classification of Toric Surface Codes of Low Dimension
- Classifying toric surface codes of dimension
- On Good Infinite Families of Toric Codes or the Lack Thereof
- Eventual quasi-linearity of the Minkowski length
- On parameterised toric codes
- Toric Codes, Multiplicative Structure and Decoding