Lattice polytopes in coding theory

Volume: 2 Number: 2 April 30, 2015
  • Ivan Soprunov
EN

Lattice polytopes in coding theory

Abstract

In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also include a new inductive bound for the minimum distance of generalized toric codes. As an application, we give new formulas for the minimum distance of generalized toric codes for special lattice point configurations.

Keywords

References

  1. O. Beckwith, M. Grimm, J. Soprunova, B. Weaver, Minkowski length of 3D lattice polytopes, Discrete and Computational Geometry 48, Issue 4, 1137-1158, 2012.
  2. W. Bosma, J. Cannon, C. Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput., 24, 235-265, 1997.
  3. G. Brown, A. M. Kasprzyk, Small polygons and toric codes, Journal of Symbolic Computation, 51, 55-62, April 2013.
  4. G. Brown, A. M. Kasprzyk, Seven new champion linear codes, LMS Journal of Computation and Mathematics, 16, 109-117, 2013.
  5. V. Cestaro, Parameters of toric codes in small dimension, Senior undergraduate project, CSU 2011.
  6. M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, online, http:// www.codetables.de/, accessed on October 1, 2013.
  7. J. Hansen, Toric surfaces and error-correcting codes in Coding Theory, Cryptography, and Related Areas, Springer, 132-142, 2000.
  8. J. Hansen, Toric varieties Hirzebruch surfaces and error-correcting codes, Appl. Algebra Engrg. Comm. Comput., 13, 289-300, 2002.

Details

Primary Language

English

Subjects

-

Journal Section

-

Authors

Ivan Soprunov This is me

Publication Date

April 30, 2015

Submission Date

April 30, 2015

Acceptance Date

-

Published in Issue

Year 2015 Volume: 2 Number: 2

APA
Soprunov, I. (2015). Lattice polytopes in coding theory. Journal of Algebra Combinatorics Discrete Structures and Applications, 2(2), 85-94. https://doi.org/10.13069/jacodesmath.75353
AMA
1.Soprunov I. Lattice polytopes in coding theory. Journal of Algebra Combinatorics Discrete Structures and Applications. 2015;2(2):85-94. doi:10.13069/jacodesmath.75353
Chicago
Soprunov, Ivan. 2015. “Lattice Polytopes in Coding Theory”. Journal of Algebra Combinatorics Discrete Structures and Applications 2 (2): 85-94. https://doi.org/10.13069/jacodesmath.75353.
EndNote
Soprunov I (April 1, 2015) Lattice polytopes in coding theory. Journal of Algebra Combinatorics Discrete Structures and Applications 2 2 85–94.
IEEE
[1]I. Soprunov, “Lattice polytopes in coding theory”, Journal of Algebra Combinatorics Discrete Structures and Applications, vol. 2, no. 2, pp. 85–94, Apr. 2015, doi: 10.13069/jacodesmath.75353.
ISNAD
Soprunov, Ivan. “Lattice Polytopes in Coding Theory”. Journal of Algebra Combinatorics Discrete Structures and Applications 2/2 (April 1, 2015): 85-94. https://doi.org/10.13069/jacodesmath.75353.
JAMA
1.Soprunov I. Lattice polytopes in coding theory. Journal of Algebra Combinatorics Discrete Structures and Applications. 2015;2:85–94.
MLA
Soprunov, Ivan. “Lattice Polytopes in Coding Theory”. Journal of Algebra Combinatorics Discrete Structures and Applications, vol. 2, no. 2, Apr. 2015, pp. 85-94, doi:10.13069/jacodesmath.75353.
Vancouver
1.Ivan Soprunov. Lattice polytopes in coding theory. Journal of Algebra Combinatorics Discrete Structures and Applications. 2015 Apr. 1;2(2):85-94. doi:10.13069/jacodesmath.75353