On the order bound of one-point algebraic geometry codes.
DOI10.1016/j.jpaa.2008.11.029zbMath1197.20052OpenAlexW2073184889MaRDI QIDQ1008769
Publication date: 30 March 2009
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpaa.2008.11.029
algebraic geometry codesnumerical semigroupsorder boundsWeierstrass semigroupssemigroups generated by arithmetic sequencesacute semigroups
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Related Items (3)
Cites Work
- Unnamed Item
- On numerical semigroups and the order bound.
- Acute Semigroups, the Order Bound on the Minimum Distance, and the Feng–Rao Improvements
- A simple approach for construction of algebraic-geometric codes from affine plane curves
- The minimum distance of codes in an array coming from telescopic semigroups
This page was built for publication: On the order bound of one-point algebraic geometry codes.