Acute Semigroups, the Order Bound on the Minimum Distance and the Feng-Rao Improvements
Abstract
We introduce a new class of numerical semigroups, which we call the class of acute semigroups and we prove that they generalize symmetric and pseudo-symmetric numerical semigroups, Arf numerical semigroups and the semigroups generated by an interval. For a numerical semigroup =\λ0<λ1<…\ denote i=\#\jλi-λj∈\. Given an acute numerical semigroup we find the smallest non-negative integer m for which the order bound on the minimum distance of one-point Goppa codes with associated semigroup satisfies dORD(Ci)(:=\j j>i\)=i+1 for all i≥ m. We prove that the only numerical semigroups for which the sequence (i) is always non-decreasing are ordinary numerical semigroups. Furthermore we show that a semigroup can be uniquely determined by its sequence (i).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.