On $m$-dimensional toric codes

Details On $m$-dimensional toric codes On $m$-dimensional toric codes

2005-06-29

arxiv.org/abs/cs/0506102v2

Computer Science

Information Theory

17 pages, 4 figures; typos corrected

Scientific paper

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 $P \subseteq \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 $m \ge 2$. 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.

Affiliated with

Also associated with

No associations

Rating

On $m$-dimensional toric codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On $m$-dimensional toric codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On $m$-dimensional toric codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-234512