Lattice polytopes in coding theory
classification
💻 cs.IT
math.COmath.IT
keywords
codesdistancelatticeminimumtoricgeneralizedpolytopesapplication
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.