Acute Semigroups, the Order Bound on the Minimum Distance and the Feng-Rao Improvements

July 31, 2023 Β· Declared Dead Β· πŸ› IEEE Transactions on Information Theory

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors M. Bras-AmorΓ³s arXiv ID 2307.16448 Category cs.IT: Information Theory Cross-listed cs.DM Citations 38 Venue IEEE Transactions on Information Theory Last Checked 6 months ago
Abstract
We introduce a new class of numerical semigroups, which we call the class of {\it 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<\dots\}$ denote $Ξ½_i=\#\{j\midΞ»_i-Ξ»_j\inΞ›\}$. 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 $d_{ORD}(C_i)(:=\min\{Ξ½_j\mid j>i\})=Ξ½_{i+1}$ for all $i\geq 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)$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted