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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Hartshorne (1977) Algebraic Geometry (GTM 52) Springer New York, Heidelberg Berlin
M. Homma and S. J. Kim, Toward the determination of the minimum distance of two-point codes on a Hermitian curve, Designs, Codes and Cryptography, to appear.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: D. Jungnickel
AMS Classification: 94B27, 14H50, 11T71, 11G20
Rights and permissions
About this article
Cite this article
Homma, M., Kim, S.J. The Two-Point Codes on a Hermitian Curve with the Designed Minimum Distance. Des Codes Crypt 38, 55–81 (2006). https://doi.org/10.1007/s10623-004-5661-x
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-004-5661-x