The minimum distance of parameterized codes on projective tori

Abstract

Let X be a subset of a projective space, over a finite field K, which is parameterized by the monomials arising from the edges of a clutter. Let I(X) be the vanishing ideal of X. It is shown that I(X) is a complete intersection if and only if X is a projective torus. In this case we determine the minimum distance of any parameterized linear code arising… (More)
DOI: 10.1007/s00200-011-0148-2

Topics

Statistics

051015201520162017
Citations per Year

Citation Velocity: 6

Averaging 6 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics