arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0507598math.AG
收藏

Toric surface codes and Minkowski sums

John Little, Hal Schenck

英文摘要:

Toric codes are evaluation codes obtained from an integral convex polytope $P \subset \R^n$ and finite field $\F_q$. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently by J. Hansen and D. Joyner. In this paper, we obtain upper and lower bounds on the minimum distance of a toric code constructed from a polygon $P \subset \R^2$ by examining Minkowski sum decompositions of subpolygons of $P$. Our results give a simple and unifying explanation of bounds of Hansen and empirical results of Joyner; they also apply to previously unknown cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑