Name
Abstract | ||
|---|---|---|
In this paper we prove new lower bounds for the minimum distance of a toric surface code $\mathcal{C}_P$ defined by a convex lattice polygon $P\subset\mathbb{R}^2$. 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$. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1137/080716554 | SIAM J. Discrete Math. |
Keywords | Field | DocType |
minkowski length,minimum distance,toric surface codes,polynomial time,new lower bound,lattice point,convex lattice polygon,toric surface code,full minkowski length,geometric invariant,algebraic geometry,lower bound,minkowski sum | Discrete mathematics,Combinatorics,Polygon,Upper and lower bounds,Convex polygon,Minkowski space,Regular polygon,Lattice (group),Invariant (mathematics),Minkowski addition,Mathematics | Journal |
Volume | Issue | ISSN |
23 | 1 | SIAM J. Discrete Math. 23, Issue 1, (2009) pp. 384-400 |
Citations | PageRank | References |
12 | 0.94 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivan Soprunov | 1 | 21 | 3.68 |
| Jenya Soprunova | 2 | 21 | 2.37 |