Acute Semigroups, the Order Bound on the Minimum Distance, and the Feng–Rao Improvements
From MaRDI portal
Publication:3546608
DOI10.1109/TIT.2004.828104zbMath1233.20054WikidataQ57728746 ScholiaQ57728746MaRDI QIDQ3546608
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
20M14: Commutative semigroups
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
Related Items
Counting Numerical Semigroups, Parametrizing Arf numerical semigroups, Computation of numerical semigroups by means of seeds, On κ-sparse numerical semigroups, Unnamed Item, On some invariants in numerical semigroups and estimations of the order bound., The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting, On numerical semigroups and the order bound., Gaps in semigroups, On the order bound of one-point algebraic geometry codes., 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., Patterns on numerical semigroups., Algebraic-geometry codes, one-point codes, and evaluation codes, NONHOMOGENEOUS PATTERNS ON NUMERICAL SEMIGROUPS, Generalizing strong admissibility of patterns of numerical semigroups