Lattice polytopes in coding theory
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1461537 (Why is no real title available?)
- Algebraic geometric codes. Basic notions
- Bringing toric codes to the next dimension
- Dual toric codes and polytopes of degree one
- Minkowski length of 3D lattice polytopes
- On classification of toric surface codes of low dimension
- On the parameters of r-dimensional toric codes
- On the structure of generalized toric codes
- On toric codes and multivariate Vandermonde matrices
- Remarks on generalized toric codes
- Seven new champion linear codes
- Small polygons and toric codes
- The Magma algebra system. I: The user language
- Toric Surface Codes and Minkowski Sums
- Toric codes over finite fields
- Toric surface codes and Minkowski length of polygons
- Toric varieties, Hirzebruch surfaces and error-correcting codes
Cited in
(19)- scientific article; zbMATH DE number 66681 (Why is no real title available?)
- Classifying toric surface codes of dimension 7
- Toric surface codes and Minkowski length of polygons
- Minkowski length of 3D lattice polytopes
- On good infinite families of toric codes or the lack thereof
- Seven new champion linear codes
- Lattice point enumeration and applications
- Secret sharing schemes with strong multiplication and a large number of players from toric varieties
- Rotated \(D_n\)-lattices in dimensions power of 3
- The dual of an evaluation code
- \(\mathbb{F}_q\)-zeros of sparse trivariate polynomials and toric 3-fold codes
- Evaluation codes and their basic parameters
- On toric codes and multivariate Vandermonde matrices
- Parameterized codes over some embedded sets and their applications to complete graphs
- Small polygons and toric codes
- Dual toric codes and polytopes of degree one
- Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
- LDPC Codes From Generalized Polygons
- scientific article; zbMATH DE number 7560557 (Why is no real title available?)
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)
