Hermitian codes and complete intersections

DOI10.1016/J.FFA.2019.101621MaRDI QIDQ2302573zbMATH OpenOpenAlexWikidataFDO

Authors Chiara Marcolla, Margherita Roggero

Publication date 26 February 2020

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

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

zbMATH Keywords

complete intersectionHermitian codeminimum-weight codeword

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: In this paper we present a geometrical characterization for the minimum-weight codewords of the Hermitian codes over the fields $mathbb{F}_{q^2}$ in the third and fourth phase, namely with distance $dgeq{q}^2-q$. We consider the unique writing $muq+lambda(q+1)$ of the distance $d$ with $mu,lambda$ non negative integers, and $muleqq$, and prove that the minimum-weight codewords correspond to complete intersection divisors cut on the Hermitian curve $mathcalH$ by curves $mathcalX$ of degree $mu+lambda$ having $x^{m}u{y}^{l}ambda$ as leading term w.r.t. the $extttDegRevLex$ term ordering (with $y>x$). Moreover, we show that any such curve $mathcalX$ corresponds to minimum-weight codewords provided that the complete intersection divisor $mathcalHcapmathcalX$ is made of simple $mathbb{F}_{q^2}$-points. Finally, using this geometric characterization, we propose an algorithm to compute the number of minimum weight codewords and we present comparison tables between our algorithm and MAGMA command $mathttMinimumWords$.

Review text

Let \(\mathcal{H}\) be the Hermitian curve \(y^q+y=x^{q+1}\) plus a point at \(\infty\) over the field \(\mathbb {F}_{q^2}\). An Hermitian code is an \([n,k,d]\) one-point code in which the vector space is \(H^0(\mathcal {O}_{\mathcal {H}}(t\infty))\) for some \(t\). Here \(n =q^3\). All the minimum distance \(d\) of such codes are known in terms of \(t\). They depends on the \(t\) and \(q\). In a certain region of the plane \((q,t)\) the authors in [J. Pure Appl. Algebra 223, No. 9, 3843--3858 (2019; Zbl 1436.11070)] proved that the support of the minimum weight or low weight codewords are certain complete intersections of \(\mathcal {H}\) with a certain very low degree curve. Here the authors (in the region \(d\geq q^2-q\)) give a similar result in another region of \((t,q)\), but with a more explicit way to obtain them the precise minimum weight codewords (giving algorithms in Magma). Write \(d =\mu q +\lambda (q+1)\) with \(\mu \le q\). they prove that a zero-dimensional scheme \(Z\subset {\mathbb {F}_{q^2}}^2\) is the support of a minimum-weight codewors if and only if it is formed by \(d\) distinct points and it is the complete intersection (outside \(\infty\)) of \(\mathcal {H}\) with a curve \(X\) of degree \(\lambda +\mu\) whose equation has \(x^\mu y^\lambda\) as leading term with respect to DegRevLex with \(y>x\).

Recommendations

• Minimum-weight codewords of the Hermitian codes are supported on complete intersections
• The dual geometry of Hermitian two-point codes
• Toward the determination of the minimum distance of two-point codes on a Hermitian curve.
• Generalized Hamming weights of codes over the \(\mathcal{GH}\) curve
• The complete determination of the minimum distance of two-point codes on a Hermitian curve
• Weierstrass semigroups and codes from a quotient of the Hermitian curve
• On the geometry of Hermitian one-point codes
• scientific article; zbMATH DE number 5139462
• On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve
• On the dimension of the subfield subcodes of 1-point Hermitian codes

Cites work

• A characterization of Hermitian function fields over finite fields.
• A note on Hermitian codes over GF(q/sup 2/)
• Algebraic curves over a finite field
• Algebraic Function Fields and Codes
• Algebraic Soft-Decision Decoding of Hermitian Codes
• Bounding the minimum distance of affine variety codes using symbolic computations of footprints
• Bounds for generalized Hamming weights of general AG codes
• Constructions in Algebra
• Decoding of Hermitian codes: the key equation and efficient error evaluation
• Evaluation codes from an affine variety code perspective
• Footprints or generalized Bezout's theorem
• Generalized Hamming weights of q-ary Reed-Muller codes
• Generalized Reed - Solomon codes from algebraic geometry
• Higher Hamming weights for locally recoverable codes on algebraic curves
• scientific article; zbMATH DE number 125903 (Why is no real title available?)
• scientific article; zbMATH DE number 1284423 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 194422 (Why is no real title available?)
• Improved decoding of affine-variety codes
• List decoding of Hermitian codes using Gröbner bases
• Minimum distance of Hermitian two-point codes
• Minimum-weight codewords of the Hermitian codes are supported on complete intersections
• On the geometry of Hermitian one-point codes
• On the Hermitian curve and its intersections with some conics
• On the small-weight codewords of some Hermitian codes
• On the weight hierarchy of geometric Goppa codes
• Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
• Remarks on codes from Hermitian curves (Corresp.)
• The complete determination of the minimum distance of two-point codes on a Hermitian curve
• The dual geometry of Hermitian two-point codes
• The dual minimum distance of arbitrary-dimensional algebraic-geometric codes
• The minimum distance of codes in an array coming from telescopic semigroups
• The second and third generalized Hamming weights of Hermitian codes
• The second generalized Hamming weight for two-point codes on a Hermitian curve
• The two-point codes on a Hermitian curve with the designed minimum distance
• The two-point codes with the designed distance on a Hermitian curve in even characteristic
• The Weight Hierarchy of Hermitian Codes
• Toward the determination of the minimum distance of two-point codes on a Hermitian curve.

Cited in

(20)

• A note on the minimum distance of Hermitian codes
• A characterization of Hermitian varieties as codewords
• On nested code pairs from the Hermitian curve
• Hermitian duality of left dihedral codes over finite fields
• Codes defined by forms of degree 2 on Hermitian surfaces and Sørensen's conjecture
• Minimum-weight codewords of the Hermitian codes are supported on complete intersections
• The two-point codes on a Hermitian curve with the designed minimum distance
• A formula on the weight distribution of linear codes with applications to AMDS codes
• Stopping Sets of Hermitian Codes
• On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve
• Hermitian codes from higher degree places
• On the Hermitian curve and its intersections with some conics
• On the geometry of Hermitian one-point codes
• scientific article; zbMATH DE number 721912 (Why is no real title available?)
• scientific article; zbMATH DE number 1960946 (Why is no real title available?)
• On the dual code of points and generators on the Hermitian variety \(\mathcal{H}(2n+1,q^2)\)
• A zero-dimensional approach to Hermitian codes
• On the small-weight codewords of some Hermitian codes
• The Weight Hierarchy of Hermitian Codes
• A proof of Sørensen's conjecture on Hermitian surfaces

This page was built for publication: Hermitian codes and complete intersections

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