On the parameters of algebraic-geometry codes related to Arf semigroups

DOI10.1109/18.887872zbMath1016.94036MaRDI QIDQ2705991

Carlos Munuera, José I. Farrán, Antonio Campillo

Publication date: 19 March 2001

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.887872

zbMATH Keywords

linear codes; algebraic geometry codes; Arf semigroups; Feng-Rao bound; order bound; improved geometric codes

Mathematics Subject Classification ID

94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory

Related Items

Antonio Campillo, Parametrizing Arf numerical semigroups, Young tableaux and Arf partitions, A fast algorithm for constructing Arf closure and a conjecture, Coset bounds for algebraic geometric codes, The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting, On numerical semigroups and the order bound., Gaps in 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, Goppa-like bounds for the generalized Feng-Rao distances., On partitions and Arf semigroups, Patterns on numerical semigroups., An improvement of the Feng-Rao bound on minimum distance, Towards a better understanding of the semigroup tree, On the generalized Feng-Rao numbers of numerical semigroups generated by intervals, NONHOMOGENEOUS PATTERNS ON NUMERICAL SEMIGROUPS, Generalizing strong admissibility of patterns of numerical semigroups