Title of article
Lattice polytopes in coding theory
Author/Authors
Soprunov, Ivan Cleveland State University - Department of Mathematics, USA
From page
85
To page
94
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
Toric code , Lattice polytope , Minkowski length , Sparse polynomials
Journal title
Journal Of Algebra Combinatorics Discrete Structures and Applications
Journal title
Journal Of Algebra Combinatorics Discrete Structures and Applications
Record number
2650122
Link To Document