Generalized minimum distance functions and algebraic invariants of Geramita ideals

DOI10.1016/J.AAM.2019.101940MaRDI QIDQ2280053zbMATH OpenOpenAlexWikidataFDO

Authors Susan Marie Cooper, Alexandra Seceleanu, Stefan O. Tohǎneanu, Rafael H. Villarreal, Maria Vaz Pinto

Publication date 17 December 2019

Published in Advances in Applied Mathematics (Search for Journal in Brave)

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

degree generalized minimum distance generalized minimum distance function of an ideal Geramita ideal Hilbert function linear 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) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: Motivated by notions from coding theory, we study the generalized minimum distance (GMD) function

d e l t a_{I} (d, r)

of a graded ideal

I

in a polynomial ring over an arbitrary field using commutative algebraic methods. It is shown that

d e l t a_{I}

is non-decreasing as a function of

r

and non-increasing as a function of

d

. For vanishing ideals over finite fields, we show that

d e l t a_{I}

is strictly decreasing as a function of

d

until it stabilizes. We also study algebraic invariants of Geramita ideals. Those ideals are graded, unmixed,

1

-dimensional and their associated primes are generated by linear forms. We also examine GMD functions of complete intersections and show some special cases of two conjectures of Tohu{a}neanu--Van Tuyl and Eisenbud-Green-Harris.

Review text

Inspired by the notion of generalized (Hamming) minimum distance (GMD) of a linear error-correcting code \(C\),\, defined over a field \(K\),\, see [\textit{V. K. Wei}, IEEE Trans. Inf. Theory 37, No. 5, 1412--1418 (1991; Zbl 0735.94008)] the authors transfer and study that concept in the context of commutative algebra. For so doing the paper begins interpreting the generalized distance \(\delta_r(C)\)\, in terms of an ideal \(I\subset K[t_1,\dots,t_s]\)\, generated by the columns of a \(s \times n\)\, generator matrix of \(C\). This allows to define \(\delta_I(d,r)\)\, the GMD function of any graded ideal \(I\)\, of \(S=K[t_1,\dots,t_s]=\bigoplus_{d=0} ^\infty S_d\). Section 2 gathers some necessary concepts and results of Commutative Algebra, in particular the notion of the footprint of an ideal and Section 3 studies the \(\delta_I(d,r)\)\, for a graded ideal \(I\). Theorem 3.9 proves that the generalized footprint \(fp_I(d,r)\)\, provides a lower bound for \(\delta_I(d,r)\)\, and that \(\delta_I(d,r)\)\, is non-decreasing as a function of \(r\)\, and non-increasing as a function of \(d\). Section 4 gives an inequality generalizing the Singleton bound for the minimum distance in the case \(I\)\, a Geramita ideal (an unmixed graded ideal of dimension 1 whose associated primes are generated by linear forms). Section 5 studies the case of projective Reed-Muller-type codes and finally Section 6 considers some proprieties and conjectures for the minimum distance \(\delta_I(d)=\delta_I(d,1)\)\, when \(I\)\, is a complete intersection ideal.

Recommendations

Cites work

Cited in

(37)

Describes a project that uses

Uses Software

Macaulay2

This page was built for publication: Generalized minimum distance functions and algebraic invariants of Geramita ideals

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