Hermitian codes and complete intersections
From MaRDI portal
Abstract: In this paper we present a geometrical characterization for the minimum-weight codewords of the Hermitian codes over the fields in the third and fourth phase, namely with distance . We consider the unique writing of the distance with non negative integers, and , and prove that the minimum-weight codewords correspond to complete intersection divisors cut on the Hermitian curve by curves of degree having as leading term w.r.t. the term ordering (with ). Moreover, we show that any such curve corresponds to minimum-weight codewords provided that the complete intersection divisor is made of simple -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 .
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
- 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?)
- A characterization of Hermitian function fields over finite fields.
- A note on Hermitian codes over GF(q/sup 2/)
- Algebraic Function Fields and Codes
- Algebraic Soft-Decision Decoding of Hermitian Codes
- Algebraic curves over a finite field
- 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
- 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 Hermitian curve and its intersections with some conics
- On the geometry of Hermitian one-point codes
- 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 Weight Hierarchy of Hermitian Codes
- 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
- Toward the determination of the minimum distance of two-point codes on a Hermitian curve.
Cited in
(20)- The two-point codes on a Hermitian curve with the designed minimum distance
- A proof of Sørensen's conjecture on Hermitian surfaces
- On the Hermitian curve and its intersections with some conics
- On the small-weight codewords of some Hermitian codes
- On nested code pairs from the Hermitian curve
- A formula on the weight distribution of linear codes with applications to AMDS codes
- Minimum-weight codewords of the Hermitian codes are supported on complete intersections
- A characterization of Hermitian varieties as codewords
- Hermitian duality of left dihedral codes over finite fields
- A note on the minimum distance of Hermitian codes
- Hermitian codes from higher degree places
- On the geometry of Hermitian one-point codes
- On the dual code of points and generators on the Hermitian variety \(\mathcal{H}(2n+1,q^2)\)
- Stopping Sets of Hermitian Codes
- The Weight Hierarchy of Hermitian 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?)
- Codes defined by forms of degree 2 on Hermitian surfaces and Sørensen's conjecture
- On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve
- A zero-dimensional approach to Hermitian codes
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)