Title
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 from X.
Year
DOI
Venue
2011
10.1007/s00200-011-0148-2
Appl. Algebra Eng. Commun. Comput.
Keywords
Field
DocType
Complete intersections,Evaluation codes,Parameterized codes,Minimum distance,Degree,Regularity,Hilbert function,Primary 13P25,Secondary 14G50,14G15,11T71,94B27,94B05
Discrete mathematics,Parameterized complexity,Combinatorics,Complete intersection,Hilbert series and Hilbert polynomial,Torus,Pencil (mathematics),Linear code,Quaternionic projective space,Mathematics,Projective space
Journal
Volume
Issue
ISSN
22
4
Appl. Algebra Engrg. Comm. Comput. 22 (2011), no. 4, 249--264
Citations 
PageRank 
References 
12
0.95
8
Authors
3
Name
Order
Citations
PageRank
Eliseo Sarmiento1163.00
Maria Vaz Pinto2183.02
Rafael H. Villarreal37515.69