Parameterized affine codes

DOI10.1556/SSCMATH.49.2012.3.1216zbMATH Open1289.13022arXiv1109.2353OpenAlexW2962686509MaRDI QIDQ2859348FDOQ2859348

Authors: Eliseo Sarmiento, Maria Vaz Pinto, Rafael H. Villarreal, Hiram H. López 

Publication date: 7 November 2013

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Abstract: Let K be a finite field and let X* be an affine algebraic toric set parameterized by monomials. We give an algebraic method, using Groebner bases, to compute the length and the dimension of C_X*(d), the parameterized affine code of degree d on the set X*. If Y is the projective closure of X*, it is shown that C_X^*(d) has the same basic parameters that C_Y(d), the parameterized projective code on the set Y. If X* is an affine torus, we compute the basic parameters of C_X*(d). We show how to compute the vanishing ideals of X* and Y.

Full work available at URL: https://arxiv.org/abs/1109.2353

Recommendations

• Parameters of the codes over affine varieties
• Almost affine codes
• Affine Cartesian codes
• Affine nonsystematic codes
• Affine Grassmann Codes
• scientific article; zbMATH DE number 2185736
• Affine Cartesian codes with complementary duals
• Projective parameterized linear codes
• scientific article; zbMATH DE number 704211
• Affine Reflection Group Codes

zbMATH Keywords

minimum distancedimensionlengthlinear codesevaluation codesvanishing idealsprojective codesaffine Hilbert functionparameterized affine codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Linear codes (general theory) (94B05) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited In (14)

• Direct products in projective Segre codes
• Affine 3-nonsystematic codes
• Almost affine codes
• Parameterized codes over graphs
• The dual of an evaluation code
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Evaluation codes and their basic parameters
• Minimum distance functions of complete intersections
• Indicator functions, \(\mathrm{v}\)-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes
• Gröbner bases methods in coding theory
• Affine Cartesian codes
• Title not available (Why is that?)
• Complete intersection vanishing ideals on degenerate tori over finite fields
• The degree and regularity of vanishing ideals of algebraic toric sets over finite fields

Uses Software

• Macaulay2

This page was built for publication: Parameterized affine codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859348)