Document Type

Article

Publication Date

2009

Publication Title

SIAM Journal on Discrete Mathematics

Abstract

In this paper we prove new lower bounds for the minimum distance of a toric surface code CP defined by a convex lattice polygon P⊂R2. The bounds involve a geometric invariant L(P), called the full Minkowski length of P. We also show how to compute L(P) in polynomial time in the number of lattice points in P.

DOI

10.1137/080716554

Version

Publisher's PDF

Volume

23

Issue

1

Included in

Mathematics Commons

Share

COinS