Codes over a weighted torus

DOI10.1016/J.FFA.2014.11.009MaRDI QIDQ2011482zbMATH OpenOpenAlexFDO

Publication date 3 August 2017

Published in Finite Fields and their Applications (Search for Journal in Brave)

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

Hilbert series index of regularity numerical semigroups projective Reed-Muller codes maximum distance separable codes vanishing ideals

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) Commutative semigroups (20M14) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: We define weighted projective Reed-Muller codes over a subset of weighted projective space over a finite field. We focus on the case when the set X is a projective weighted torus. We show that the vanishing ideal of X is a lattice ideal and relate it with the lattice ideal of a minimal presentation of the semigroup algebra of Q, the numerical semigroup generated by the weights of the projective space. We compute the index of regularity of the vanishing ideal as function of the weights and the Frobenius number of Q. We compute the basic parameters of weighted projective Reed-Muller codes over a 1-dimensional weighted torus and prove they are maximum distance separable codes.

Recommendations

Cites work

Cited in

(12)

Describes a project that uses

Uses Software

Macaulay2

This page was built for publication: Codes over a weighted torus

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