On numerical semigroups and the redundancy of improved codes correcting generic errors

DOI10.1007/s10623-009-9297-8zbMath1172.94013OpenAlexW2124653217WikidataQ57728704 ScholiaQ57728704MaRDI QIDQ1035812

Maria Bras-Amorós

Publication date: 4 November 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9297-8

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) General structure theory for semigroups (20M10) Commutative semigroups (20M14) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Isometry-Dual Flags of Many-Point AG Codes ⋮ Patterns on the Numerical Duplication by Their Admissibility Degree ⋮ Weierstrass semigroup at \(m+1\) rational points in maximal curves which cannot be covered by the Hermitian curve

Cites Work

• The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
• A note on the order bound on the minimum distance of AG codes and acute semigroups
• On the parameters of algebraic-geometry codes related to Arf semigroups
• Acute Semigroups, the Order Bound on the Minimum Distance, and the Feng–Rao Improvements
• A Note on Numerical Semigroups
• A simple approach for construction of algebraic-geometric codes from affine plane curves
• Improvements to Evaluation Codes and New Characterizations of Arf Semigroups
• On Weierstrass semigroups and the redundancy of improved geometric Goppa codes
• Improved geometric Goppa codes. I. Basic theory
• The minimum distance of codes in an array coming from telescopic semigroups
• Unnamed Item
• Unnamed Item

This page was built for publication: On numerical semigroups and the redundancy of improved codes correcting generic errors