
Abstract Castle codes are algebraic geometry one-point codes on Castle curves. This family contains some of the most important AG codes among those studied in the literature to date. The minimum distance of these codes can be bounded by using the order-like bound d ⁎ , which is known to be equivalent to the classical order bound when both can be applied. In this paper we compute d ⁎ for some Castle codes, including those related to semigroups generated by two elements and telescopic semigroups. In particular we compute the bound d ⁎ in full for Suzuki codes.
Algebra and Number Theory, Applied Mathematics, Engineering(all), Theoretical Computer Science
Algebra and Number Theory, Applied Mathematics, Engineering(all), Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
