Abstract
In this paper we study evaluation codes arising from plane quotients of the Hermitian curve, defined by affine equations of the form \(y^q+y=x^m,\,q\) being a prime power and \(m\) a positive integer which divides \(q+1\). The dual minimum distance and minimum weight of such codes are studied from a geometric point of view. In many cases we completely describe the minimum-weight codewords of their dual codes through a geometric characterization of the supports, and provide their number. Finally, we apply our results to describe Goppa codes of classical interest on such curves.
Similar content being viewed by others
Notes
Here the subscript red denotes the reduction of a zero-dimensional scheme.
We recall that \(\text{ Res }_L (A \cup E) = \text{ Res }_L (E)\), because \(A\subseteq L\), and \(\deg (\text{ Res }_L (E)) = \deg (E) -\deg (L \cap E)\).
References
Ballico, E., Ravagnani, A.: A zero-dimensional cohomological approach to Hermitian codes. http://arxiv.org/abs/1202.0894
Bernardi, A., Gimigliano, A., Idà, M.: Computing symmetric rank for symmetric tensors. J. Symbolic. Comput. 46(1), 34–53 (2011)
Chen, Q., Li, C., Pei, D.: Dimension of two-point codes on the quotient of Hermitian curves. IEEE Int. Conf. Comput. Sci. Inf. Technol. 6, 163–168 (2010)
Coleman, M.A., Drake, N., Matthews, G.L.: Codes from a quotient of the Hermitian curve attaining the designed distance. Congr. Numerantium 182, 161–170 (2006)
Couvreur, A.: The dual minimum distance of arbitrary dimensional algebraic-geometric codes. J. Algebra 350(1), 84–107 (2012)
Garcia, A., Viana, P.: Weierstrass points on certain non-classical curves. Arch. Math. 46, 315–322 (1986)
Homma, M., Kim, S.J.: Toward the determination of the minimum distance of two-point codes on a Hermitian curve. Des. Codes Cryptogr. 37(1), 11–132 (2005)
Homma, M., Kim, S.J.: The two-point codes on a Hermitian curve with the designed minimum distance. Des. Codes Cryptogr. 38(1), 55–81 (2006)
Homma, M., Kim, S.J.: The two-point codes with the designed distance on a Hermitian curve in even characteristic. Des. Codes Cryptogr. 39(3), 375–386 (2006)
Homma, M., Kim, S.J.: The complete determination of the minimum distance of two-point codes on a Hermitian curve. Des. Codes Cryptogr. 40(1), 5–24 (2006)
Korchmáros, G., Nagy, G.P.: Hermitian codes from higher degree places. J. Pure Appl. Algebra 217(12), 2371–2381 (2013)
Levy-dit-Vehel, F., Litsyn, S.: Parameters of Goppa codes revisited. IEEE Trans. Inf. Theory 43(6), 1811–1819 (1997)
Matthews, G.L.: Weierstrass semigroups and codes from a quotient of the Hermitian curve. Des. Codes Cryptogr. 37, 473–492 (2005)
Munuera, C., Pellikaan, R.: Equality of geometric Goppa codes and equivalence of divisors. J. Pure Appl. Algebra 90, 229–252 (1993)
Park, S.: Minimum distance of Hermitian two-point codes. Des. Codes Cryptogr. 57, 195–213 (2010)
Ruck, H.G., Stichtenoth, H.: A characterization of Hermitian function fields over finite fields. J. Reine Angew. Math. 457, 185–188 (1994)
Stepanov, S.A.: Codes on Algebraic Curves. Springer, Berlin (1999)
Stichtenoth, H.: Algebraic Function Fields and Codes, 2nd edn. Springer, Berlin (2009)
Yang, K., Kumar, P.V.: On the true minimum distance of Hermitian codes. Coding theory and algebraic geometry. In: Lect. Notes in Math. 1518, pp. 99–107. Springer, Berlin (1992)
Yang, K., Kumar, P.V., Stichtenoth, H.: On the weight hierarchy of geometric Goppa codes. IEEE Trans. Inform. Theory 40, 913–920 (1994)
Acknowledgments
The authors would like to thank the Referee for useful suggestions and comments that improved the presentation of this work.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ballico, E., Ravagnani, A. On the dual minimum distance and minimum weight of codes from a quotient of the Hermitian curve. AAECC 24, 343–354 (2013). https://doi.org/10.1007/s00200-013-0206-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-013-0206-z