Numerical semigroups and codes
From MaRDI portal
Abstract: A numerical semigroup is a subset of N containing 0, closed under addition and with finite complement in N. An important example of numerical semigroup is given by the Weierstrass semigroup at one point of a curve. In the theory of algebraic geometry codes, Weierstrass semigroups are crucial for defining bounds on the minimum distance as well as for defining improvements on the dimension of codes. We present these applications and some theoretical problems related to classification, characterization and counting of numerical semigroups.
Recommendations
Cited in
(13)- On the order bound of one-point algebraic geometry codes.
- Numerical semigroups.
- On numerical semigroups and the redundancy of improved codes correcting generic errors
- On the second Feng-Rao distance of algebraic geometry codes related to Arf semigroups
- Smoothability and order bound for AS semigroups.
- Canonical stretched rings
- Counting numerical semigroups by genus and even gaps
- On the minimum distance of AG codes, on Weierstrass semigroup and the smoothability of certain monomial curves in 4-space
- A Note on Numerical Semigroups
- Elasticity in Apéry sets
- On some invariants in numerical semigroups and estimations of the order bound.
- The isomorphism problem for ideal class monoids of numerical semigroups
- Motzkin paths associated with flag codes
This page was built for publication: Numerical semigroups and codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3461813)