Document Type
Article
Publication Date
2010
Publication Title
SIAM Journal on Discrete Mathematics
Abstract
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in $\mathbb{R}^n$. We show that the minimum distance is multiplicative with respect to taking the product of polytopes, and behaves in a simple way when one builds a k-dilate of a pyramid over a polytope. This allows us to construct a large class of examples of higher dimensional toric codes where we can compute the minimum distance explicitly.
Repository Citation
Soprunov, Ivan and Soprunova, Jenya, "Bringing Toric Codes to The Next Dimension" (2010). Mathematics and Statistics Faculty Publications. 123.
https://engagedscholarship.csuohio.edu/scimath_facpub/123
DOI
10.1137/090762592
Version
Publisher's PDF
Volume
24
Issue
2
