Name
Abstract | ||
|---|---|---|
We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus, with prescribed parameters of a certain type. As an application of our results, we recover the formulas for the minimum distance of various families of evaluation codes. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s10623-012-9714-2 | Des. Codes Cryptography |
Keywords | DocType | Volume |
Evaluation codes,Minimum distance,Complete intersections,Vanishing ideals,Degree,Regularity,Hilbert function,Algebraic invariants,13P25,14G50,94B27,11T71 | Journal | 71 |
Issue | ISSN | Citations |
1 | 0925-1022 | 5 |
PageRank | References | Authors |
0.56 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hiram H. López | 1 | 20 | 4.81 |
| Carlos Rentería-Márquez | 2 | 27 | 4.55 |
| Rafael H. Villarreal | 3 | 75 | 15.69 |