The Two-Point Codes with the Designed Distance on a Hermitian Curve in Even Characteristic

Authors:
Masaaki Homma;Seon Jeong Kim
Affiliations:
Department of Mathematics, Kanagawa University, Yokohama, Japan 221-8686;Department of Mathematics and RINS, Gyeongsang National University, Jinju, Korea 660-701
Venue:
Designs, Codes and Cryptography
Year:
2006

Citing 2
Cited 4

Toward the Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve

Designs, Codes and Cryptography
The Two-Point Codes on a Hermitian Curve with the Designed Minimum Distance

Designs, Codes and Cryptography

The Complete Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve

Designs, Codes and Cryptography
The second generalized Hamming weight for two-point codes on a Hermitian curve

Designs, Codes and Cryptography
Minimum distance decoding of general algebraic geometry codes via lists

IEEE Transactions on Information Theory
The order bound for general algebraic geometric codes

Finite Fields and Their Applications

Quantified Score

Hi-index	0.06

Visualization

Abstract

In Homma M and Kim SJ [2], the authors considered two-point codes on a Hermitian curve defined over fields of odd characteristic. In this paper, we study the geometry of a Hermitian curve over fields of even characteristic and classify the two-point codes whose minimum distances agree with the designed ones.