Bringing Toric Codes to the Next Dimension

  • Authors:
  • Ivan Soprunov;Jenya Soprunova

  • Affiliations:
  • i.soprunov@csuohio.edu;soprunova@math.kent.edu

  • Venue:
  • SIAM Journal on Discrete Mathematics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.