Skip to main content
Article
Lattice Polytopes in Coding Theory
Journal of Algebra Combinatorics Discrete Structures and Applications
  • Ivan Soprunov, Cleveland State University
Document Type
Article
Publication Date
1-1-2015
Disciplines
Abstract

In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove 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.

DOI
10.13069/jacodesmath.75353
Version
Publisher's PDF
Creative Commons License
Creative Commons Attribution-Noncommercial-No Derivative Works 4.0
Citation Information
Ivan Soprunov. "Lattice Polytopes in Coding Theory" Journal of Algebra Combinatorics Discrete Structures and Applications Vol. 2 Iss. 2 (2015) p. 85 - 94 ISSN: 2148-838X
Available at: http://works.bepress.com/ivan-soprunov/19/