On the generalized Feng-Rao numbers of numerical semigroups generated by intervals
Let \(S\) be a numerical semigroup, i.e., a subsemigroup of the additive semigroup of positive integers, containing all large integers, for \(\alpha\in S\) put \(D(\alpha)=\{\beta\in S:\;\alpha-\beta\in S\}\), and denote by \(\nu(\alpha)\) the cardinality of \(D(\alpha)\). One defines the \textit{Feng-Rao distance} \(\delta_{FR}(\alpha)\) of \(S\), by NEWLINE\[NEWLINE\delta_{FR}(\alpha)=\min\{\nu(\beta):\;\beta\in S, \beta\geq\alpha\}.NEWLINE\]NEWLINE This notion was generalized by \textit{P. Heijnen} and \textit{R. Pellikaan} [IEEE Trans. Inf. Theory 44, No. 1, 181--196 (1998; Zbl 1053.94581)] in the following way.NEWLINENEWLINELet \(m\in S\) and \(r\geq1\). Any \(r\)-element subset \(M\) of \(S\cap[m,\infty]\) is called a \((S,m,r)\) configuration, and denote by \(D(M)\) the union of the set of divisors of all elements of \(M\). The function NEWLINE\[NEWLINE\delta^r(m) = \min\{\#D(M):\;M\;\text{is\;a\;} (S,m,r)\;\text{configuration}\}NEWLINE\]NEWLINE is called the \textit{\(r\)th Feng-Rao distance} of \(S\). It is known \textit{J. I. Farrán} and \textit{C. Munuera} [Discrete Appl. Math. 128, No. 1, 145--156 (2003; Zbl 1037.94014)] that the number \(E(S,r) = \delta^r(m)-m-1+2g\) (where \(g\) denotes the number of positive integers \(n\notin S\)) does not depend on \(m\). It is called the \textit{\(r\)th Feng-Rao number} of \(S\).NEWLINENEWLINEThe authors present an algorithm for computing the \(r\)th Feng-Rao number for any numerical semigroup \(S\). They apply it in the special case when \(S\) is generated by an interval, and show that in this case one can obtain explicit formulas for the \(r\)-th Feng-Rao numbers.
- Goppa-like bounds for the generalized Feng-Rao distances.
- Goppa-like bounds for the generalized Feng-Rao distances
- Numerical Semigroups that Differ from a Symmetric Numerical Semigroup in One Element
- A sequence of quasipolynomials arising from random numerical semigroups
- Distribution of genus among numerical semigroups with fixed Frobenius number
- Type sequences of numerical semigroups
- Numerical semigroups.
- Constructing numerical semigroups of a given genus.
- Gapsets and numerical semigroups
- Bounds on the number of numerical semigroups of a given genus
- Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
- Decoding algebraic-geometric codes up to the designed minimum distance
- Generalized Hamming weights for linear codes
- Generalized Hamming weights of q-ary Reed-Muller codes
- Goppa-like bounds for the generalized Feng-Rao distances.
- scientific article; zbMATH DE number 1284423 (Why is no real title available?)
- On the parameters of algebraic-geometry codes related to Arf semigroups
- The catenary and tame degree of numerical monoids
- The minimum distance of codes in an array coming from telescopic semigroups
- The weight distribution of irreducible cyclic codes with block lengths n₁ ((q^-1)/N)
- The Weight Hierarchy of Hermitian Codes
- The second Feng-Rao number for codes coming from telescopic semigroups
- On the second Feng-Rao distance of algebraic geometry codes related to Arf semigroups
- Goppa-like bounds for the generalized Feng-Rao distances.
- On atomic density of numerical semigroup algebras
- Goppa-like bounds for the generalized Feng-Rao distances
- The weight hierarchy of decreasing norm-trace codes
This page was built for publication: On the generalized Feng-Rao numbers of numerical semigroups generated by intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840632)
