#### Filter Results:

#### Publication Year

1997

2007

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Toric codes are evaluation codes obtained from an integral convex polytope P ⊂ R n and finite field Fq. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently in [6], [8], [9], and [12]. In this paper, we obtain upper and lower bounds on the minimum distance of a toric code constructed from a polygon P ⊂ R 2 by… (More)

Toric codes are a class of m-dimensional cyclic codes introduced recently by J. Hansen in [7], [8], and studied in [9], [5], [10]. They may be defined as evaluation codes obtained from monomials corresponding to integer lattice points in an integral convex polytope P ⊆ R m. As such, they are in a sense a natural extension of Reed-Solomon codes. Several… (More)

- ‹
- 1
- ›