Skip to main content
Log in

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

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M Homma SJ Kim (2005) ArticleTitleToward the determination of the minimum distance of two-point codes on a Hermitian curve Des Codes Cryptogr 37 111–132 Occurrence Handle10.1007/s10623-004-3807-5 Occurrence Handle2165044

    Article  MathSciNet  Google Scholar 

  2. M Homma SJ Kim (2006) ArticleTitleThe two-point codes on a Hermitian curve with the designed minimum distance Des Codes Cryptogr 38 55–81 Occurrence Handle10.1007/s10623-004-5661-x Occurrence Handle2191125

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Seon Jeong Kim.

Additional information

Communicated by P. Charpin

Rights and permissions

Reprints and permissions

About this article

Cite this article

Homma, M., Kim, S.J. The Two-Point Codes with the Designed Distance on a Hermitian Curve in Even Characteristic. Des Codes Crypt 39, 375–386 (2006). https://doi.org/10.1007/s10623-005-5471-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-005-5471-9

Keywords

AMS Classification

Navigation