2000 character limit reached
Lattice polytopes in coding theory (1411.0028v1)
Published 31 Oct 2014 in cs.IT, math.CO, and math.IT
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.