The Two-Point Codes on a Hermitian Curve with the Designed Minimum Distance

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

Citing 1
Cited 5

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

Designs, Codes and Cryptography

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

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

This is the second part of the series of papers devoted to the determination of the minimum distance of two-point codes on a Hermitian curve. We study the case where the minimum distance agrees with the designed one. In order to construct a function which gives a codeword with the designed minimum distance, we use functions arising from conics in the projective plane.