Toric code distances from terraced polytopes
DOI:
https://doi.org/10.13069/jacodesmath.v10i1.218Keywords:
Toric code, Lattice polytopeAbstract
We call a polytope terraced if upon projecting onto a one-dimensional coordinate space, each fiber ofthe projection is contained in the fiber below it. We present a technique to compute the minimumdistance for toric codes arising from terraced polytopes. This technique is demonstrated by determining the minimum distance for all toric codes that correspond to smoothn–polytopes with $n+ 2$ facets. We also find the minimum distance for all toric codes coming from smooth polygons with fiveedges and from smooth $3$–polytopes with six facets.
Received: 18 August 2021 | Accepted: 20 January 2022Downloads
References
V. V. Batyrev, On the classification of smooth projective toric varieties, Tohoku Math. J. (2) 43(4) (1991) 569–585.
G. Brown and A. M. Kasprzyk, Seven new champion linear codes, LMS J. Comput. Math. 16 (2013) 109–117.
D. A. Cox, J. B. Little, and H. K. Schenck, Toric Varieties, Graduate Studies in Mathematics, Vol. 124, American Mathematical Society, Providence, RI, 2011.
J. P. Hansen, Toric surfaces and error-correcting codes, in: A. Buchmann et al. (Eds.), Coding Theory, Cryptography and Related Areas, Springer, Berlin, Heidelberg, 2000, pp. 132–142.
J. P. Hansen, Toric varieties, Hirzebruch surfaces and error-correcting codes, Appl. Algebra Engrg. Comm. Comput. 13(4) (2002) 289–300.
W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes, Cambridge University Press, Cambridge, 2003.
N. Hussain, X. Luo, S. S.-T. Yau, M. Zhang, and H. Zuo, On classification of toric surface codes of dimension seven, Commun. Anal. Geom. 28(2) (2020) 263–319.
D. Joyner, Toric codes over finite fields, Appl. Algebra Engrg. Comm. Comput. 15(1) (2004) 63–79.
J. L. Kimball, Bounds on codes from smooth toric threefolds with $\operatorname{rank}(\operatorname{Pic}(X)) = 2$, Ph.D. Dissertation, Texas A&M University, 2008.
P. Kleinschmidt, A classification of toric varieties with few generators, Aequationes Math. 35(2-3) (1988) 254–266.
J. Little and H. Schenck, Toric surface codes and Minkowski sums, SIAM J. Discrete Math. 20(4) (2006) 999–1014.
J. Little and R. Schwarz, On toric codes and multivariate Vandermonde matrices, Appl. Algebra Engrg. Comm. Comput. 18(4) (2007) 349–367.
J. B. Little, Algebraic geometry codes from higher dimensional varieties, in: Advances in Algebraic Geometry Codes, Series on Coding Theory and Cryptology, Vol. 5, World Scientific, Singapore, 2008, pp. 257–293.
X. Luo, S. S.-T. Yau, M. Zhang, and H. Zuo, On classification of toric surface codes of low dimension, Finite Fields Appl. 33 (2015) 90–102.
K. Meyer, I. Soprunov, and J. Soprunova, $\mathbb{F}_q$-zeros of sparse trivariate polynomials and toric 3-fold codes, SIAM J. Appl. Algebra Geom. 6(3) (2022) 432–467.
D. Ruano, On the parameters of $r$-dimensional toric codes, Finite Fields Appl. 13(4) (2007) 962–976.
I. Soprunov, Lattice polytopes in coding theory, J. Algebra Comb. Discrete Appl. 2(2) (2015) 85–94.
I. Soprunov and J. Soprunova, Toric surface codes and Minkowski length of polygons, SIAM J. Discrete Math. 23(1) (2009) 384–400.
I. Soprunov and J. Soprunova, Bringing toric codes to the next dimension, SIAM J. Discrete Math. 24(2) (2010) 655–665.
J. L. Walker, Codes and Curves, Student Mathematical Library, Vol. 7, American Mathematical Society, Providence, RI, 2000.
G. M. Ziegler, Lectures on Polytopes, Graduate Texts in Mathematics, Vol. 152, Springer-Verlag, New York, 1995.