Castle curves and codes (Q2268672)

The paper under review proposes two families of pointed curves \((\chi,Q)\), defined over a finite field: the \textit{Castle} curves and the \textit{weak Castle} curves, such that certain one-point algebraic geometric codes \(C(\chi ,D, G=mQ)\),\, arising from those curves, have nice properties. It is worthwhile to mention that the name `Castle curves' is motivated because a preliminary version of the paper was exposed at the Second Castle Meeting taken place in the castle of La Mota (Medina del Campo, Spain), in [Coding theory and applications. Second international castle meeting, ICMCTA 2008, Castillo de La Mota, Medina del Campo, Spain, September 15--19, 2008. Proceedings. Berlin: Springer. Lecture Notes in Computer Science 5228, 117-127 (2008; Zbl 1166.94012)]. Section 2 defines Castle curves as curves attaining equality in the Lewittes-Geil-Matsumoto bound [\textit{O. Geil, R. Matsumoto}, J. Pure Appl. Algebra 213, 1152--1156 (2009; Zbl 1180.14018)] and the broader class of weak Castle curves. The section provides examples showing that many known curves are Castle or weak Castle curves. Section 3 studies the one-point codes \(C_m=C(\chi ,D, mQ)\),\, where \(\chi\)\, is a Castle or weak Castle curve and the divisor \(D\)\, is defined in the section 2. So Proposition 3 shows that the dimension \(k_m\)\, of \(C_m\)\, can be computed in terms of the Weierstrass semigroup, Proposition 4 gives conditions so that \(C_m\)\, reaches equality in the Goppa bound, Proposition 5 gives bounds for the generalized Hamming weights \(d_m^r\)\, of \(C_m\)\, and finally Proposition 6 relates \(d_m^r\)\, with the order (or Feng-Rao) bounds [\textit{P. Heijnen, R. Pellikaan}, IEEE Trans. Inform. Theory 44, 181--197 (1998; Zbl 1053.94581)].