Geometry of the minimum distance

DOI10.1007/S00200-024-00659-1MaRDI QIDQ6898869zbMATH OpenFDO

Authors John Pawlina, Stefan O. Tohǎneanu

Publication date 17 November 2025

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00200-024-00659-1

zbMATH Keywords

evaluation codesfree resolutiongeneralized projective Reed-Muller codesinitial degreeminimum distancesocle degrees

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Syzygies, resolutions, complexes and commutative rings (13D02) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) 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)

Review text

Let \(X\subset \mathbb{P}^{k-1}\) be a finite set defined over a field \(K\). For any positive integer \(a\) let \(R_a\) denote the set of all homogeneous forms \(f\in K[x_1,\dots,x_k]\) of degree \(a\). Evaluating \(R_a\) at each point of \(X\), we get (up to equivalence) a linear code, at least if \(K\) is finite. Let \(d(X)_a\) denote the minimum distance of this code. The aim (fully realized) of the paper under review is to give lower bounds on \(d(X)_a\) in terms commutative-algebra invariants of \(X\), e.g. the socle degree \(s(X)\), or geometric properties of \(X\), e.g. to be il linear general position. Let \(\alpha(X)\) be the initial degree of \(X\), i.e. the minimal degree of a linear form vanishing on \(X\). One of the result of this paper is that if \(1\le a\le \alpha\), then\N\[\Nd(X)_a\ge \binom{\alpha(X)-1-a+k-1}{k-1}.\N\]\NThe right hand side of this inequality is at least \((k-1)(\alpha(X)-1-a)+1\). If \(X\) is in linear general position, then either \(d(X)_a\le k-1\) or \(d(X)_a\ge (k-1)(s(X)-1-a)+2\). In the introduction the authors explain very well how/why certain classical algebro-geometric results over an algebraically closed field may be used for codes over a finite field.

Cites work

• Algebraic geometric codes. Basic notions
• Betti numbers of perfect homogeneous ideals
• Bounding invariants of fat points using a coding theory construction
• Cayley-Bacharach and evaluation codes on complete intersections
• Cayley-Bacharach Schemes and Their Canonical Modules
• Cayley-Bacharach theorems and conjectures
• Commutative algebra methods for coding theory
• Evaluation codes and their basic parameters
• Generalized minimum distance functions and algebraic invariants of Geramita ideals
• scientific article; zbMATH DE number 671739 (Why is no real title available?)
• scientific article; zbMATH DE number 2043995 (Why is no real title available?)
• Linkage and codes on complete intersections
• Lower bounds on minimal distance of evaluation codes
• Minimal free resolutions of general points lying on cubic surfaces in \(\mathbb P^3\)
• Separators of fat points in P^n.
• The Geometry of Syzygies
• The Horace method for error-correcting codes
• The ideal of forms vanishing at a finite set of points in \({\mathbb{P}}^ n\)
• The minimal resolution conjecture
• The minimum distance of sets of points and the minimum socle degree
• The projective geometry of the Gale transform.

This page was built for publication: Geometry of the minimum distance

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