On toric codes and multivariate Vandermonde matrices

DOI10.1007/S00200-007-0041-1zbMATH Open1166.94355arXivcs/0506102OpenAlexW1999113954MaRDI QIDQ1016575FDOQ1016575

Authors: Ryan Schwarz, John B. Little 

Publication date: 6 May 2009

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Abstract: Toric codes are a class of $m$-dimensional cyclic codes introduced recently by J. Hansen. They may be defined as evaluation codes obtained from monomials corresponding to integer lattice points in an integral convex polytope $Psubseteq{R}^m$. As such, they are in a sense a natural extension of Reed-Solomon codes. Several authors have used intersection theory on toric surfaces to derive bounds on the minimum distance of some toric codes with $m=2$. In this paper, we will provide a more elementary approach that applies equally well to many toric codes for all $mge2$. Our methods are based on a sort of multivariate generalization of Vandermonde determinants that has also been used in the study of multivariate polynomial interpolation. We use these Vandermonde determinants to determine the minimum distance of toric codes from rectangular polytopes and simplices. We also prove a general result showing that if there is a unimodular integer affine transformation taking one polytope $P_1$ to a second polytope $P_2$, then the corresponding toric codes are monomially equivalent (hence have the same parameters). We use this to begin a classification of two-dimensional toric codes with small dimension.

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

Recommendations

• On the structure of generalized toric codes
• Toric Surface Codes and Minkowski Sums
• On the parameters of two special toric surface codes
• Remarks on generalized toric codes
• Lattice polytopes in coding theory

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Title not available (Why is that?)
• Lectures on Polytopes
• Title not available (Why is that?)
• The Newton polygon of plane curves with many rational points
• Toric varieties, Hirzebruch surfaces and error-correcting codes
• Toric codes over finite fields
• Polynomial interpolation in several variables
• Toric Surface Codes and Minkowski Sums

Cited In (18)

• On parameterized toric codes
• Tropicalization and irreducibility of generalized Vandermonde determinants
• A Vandermonde code construction
• Classifying toric surface codes of dimension 7
• On good infinite families of toric codes or the lack thereof
• Seven new champion linear codes
• Lattice polytopes in coding theory
• Secret sharing schemes with strong multiplication and a large number of players from toric varieties
• Notes on classification of toric surface codes of dimension 5
• \(\mathbb{F}_q\)-zeros of sparse trivariate polynomials and toric 3-fold codes
• The metric structure of linear codes
• Toric codes and finite geometries
• On the structure of generalized toric codes
• Toric codes from order polytopes
• On classification of toric surface codes of low dimension
• On the parameters of \(r\)-dimensional toric codes
• Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes
• Locally recoverable codes from rational maps

This page was built for publication: On toric codes and multivariate Vandermonde matrices

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