Parameterized affine codes (Q2859348)

From MaRDI portal





scientific article; zbMATH DE number 6223874
Language Label Description Also known as
English
Parameterized affine codes
scientific article; zbMATH DE number 6223874

    Statements

    Parameterized affine codes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2013
    0 references
    evaluation codes
    0 references
    parameterized affine codes
    0 references
    vanishing ideals
    0 references
    minimum distance
    0 references
    dimension
    0 references
    length
    0 references
    affine Hilbert function
    0 references
    linear codes
    0 references
    projective codes
    0 references
    The authors study affine codes parametrised by monomials and their projective form. The main point is to compute the dimension, the length and the minimum distance of these codes using Gröbner bases. It is shown that these basic parameters coincide for the affine and the projective form of such a code and that the first two parameters can be expressed in terms of the Hilbert function and the degree of the homogeneous vanishing ideal. In particular, the basic parameters are computed for the case that the code comes from an affine torus. Finally, the authors present an implementation of their results in Macaulay 2.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references