TORIC SURFACE CODES AND MINKOWSKI LENGTH OF POLYGONS

被引：24
|
作者：
Soprunov, Ivan [1 ]
Soprunova, Jenya [2 ]
机构：
[1] Cleveland State Univ, Dept Math, Cleveland, OH 44115 USA
[2] Kent State Univ, Dept Math Sci, Kent, OH 44242 USA
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2009年 / 23卷 / 01期
关键词：
evaluation codes; toric codes; Minkowski sum;
D O I：
10.1137/080716554
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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 subset of 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.
引用
收藏
页码：384 / 400
页数：17
相关论文
共 50 条
12345