Lattice polytopes in coding theory

From MaRDI portal
Publication:307910

zbMATH Open1348.14074arXiv1411.0028MaRDI QIDQ307910FDOQ307910


Authors: Ivan Soprunov Edit this on Wikidata


Publication date: 5 September 2016

Published in: Journal of Algebra Combinatorics Discrete Structures and Applications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1411.0028




Recommendations




Cites Work


Cited In (19)

Uses Software





This page was built for publication: Lattice polytopes in coding theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q307910)