Indexed metadata
Lattice polytopes in coding theory
Ivan Soprunov
Source record
Source: Crossref
Published: May 15, 2015
DOI: 10.13069/jacodesmath.75353
Open original source ↗Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.