Improvements to Evaluation Codes and New Characterizations of Arf Semigroups
From MaRDI portal
Publication:4426699
DOI10.1007/3-540-44828-4_22zbMath1031.94551OpenAlexW42559949MaRDI QIDQ4426699
Publication date: 16 September 2003
Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-44828-4_22
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Related Items (9)
Patterns on numerical semigroups. ⋮ The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting ⋮ A fast algorithm for constructing Arf closure and a conjecture ⋮ Parametrizing Arf numerical semigroups ⋮ Patterns on the Numerical Duplication by Their Admissibility Degree ⋮ Generalizing strong admissibility of patterns of numerical semigroups ⋮ Gaps in semigroups ⋮ On numerical semigroups and the redundancy of improved codes correcting generic errors ⋮ NONHOMOGENEOUS PATTERNS ON NUMERICAL SEMIGROUPS
This page was built for publication: Improvements to Evaluation Codes and New Characterizations of Arf Semigroups