Lattice polytopes in coding theory
arXiv:1411.0028 · doi:10.13069/jacodesmath.75353
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.
11 pages, 3 figures