The two-point codes with the designed distance on a Hermitian curve in even characteristic

DOI10.1007/s10623-005-5471-9zbMath1111.14015OpenAlexW2049117255MaRDI QIDQ2491314

Seon Jeong Kim, Masaaki Homma

Publication date: 29 May 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-005-5471-9

zbMATH Keywords

Hermitian curveminimum distancetwo-point codedesigned distance

Mathematics Subject Classification ID

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

Related Items

The order bound for general algebraic geometric codes ⋮ Non-special subsets of the set of points of a curve defined over a finite field ⋮ Minimum distance of Hermitian two-point codes ⋮ The complete determination of the minimum distance of two-point codes on a Hermitian curve ⋮ Coherence of sensing matrices coming from algebraic-geometric codes ⋮ Near weights on higher dimensional varieties ⋮ On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve ⋮ The dual geometry of Hermitian two-point codes ⋮ Minimum-weight codewords of the Hermitian codes are supported on complete intersections ⋮ Multi-point codes over Kummer extensions ⋮ A zero-dimensional approach to Hermitian codes ⋮ On the Weierstrass semigroups of \(n\) points of a smooth curve ⋮ The second generalized Hamming weight for two-point codes on a Hermitian curve ⋮ Hermitian codes and complete intersections

Cites Work

• The two-point codes on a Hermitian curve with the designed minimum distance
• Toward the determination of the minimum distance of two-point codes on a Hermitian curve.