Abstract
We introduce a new sequence τ associated to a numerical semigroup similar to the ν sequence used to define the order bound on the minimum distance and to describe the Feng–Rao improved codes. The new sequence allows a nice description of the optimal one-point codes correcting generic errors and to compare them with standard codes and with the Feng–Rao improved codes. The relation between the τ sequence and the ν sequence gives a new characterization of Arf semigroups and it is shown that the τ sequence of a numerical semigroup unequivocally determines it.
Similar content being viewed by others
References
Bras-Amorós M.: Improvements to evaluation codes and new characterizations of Arf semigroups. In: Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Toulouse, 2003). Lecture Notes in Comput. Sci., vol. 2643, pp. 204–215. Springer, Berlin (2003).
Bras-Amorós M.: Acute semigroups, the order bound on the minimum distance, and the Feng-Rao improvements. IEEE Trans. Inform. Theory 50(6), 1282–1289 (2004)
Bras-Amorós M.: A note on numerical semigroups. IEEE Trans. Inform. Theory 53(2), 821–823 (2007)
Bras-Amorós M., O’Sullivan M.E.: The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting. Appl. Algebra Engrg. Comm. Comput. 17(5), 315–335 (2006)
Campillo A., Farrán J.I., Munuera C.: On the parameters of algebraic-geometry codes related to Arf semigroups. IEEE Trans. Inform. Theory 46(7), 2634–2638 (2000)
Feng G.L., Rao T.R.N.: A simple approach for construction of algebraic-geometric codes from affine plane curves. IEEE Trans. Inform. Theory 40(4), 1003–1012 (1994)
Feng G.-L., Rao T.R.N.: Improved geometric Goppa codes. I. Basic theory. IEEE Trans. Inform. Theory 41(6, part 1), 1678–1693 (1995). Special issue on algebraic geometry codes.
Hansen J.P.: Dependent rational points on curves over finite fields—Lefschetz theorems and exponential sums. In: International Workshop on Coding and Cryptography (Paris, 2001). Electron. Notes Discrete Math., vol. 6, pp. 13 (electronic). Elsevier, Amsterdam (2001).
Høholdt T., van Lint J.H., Pellikaan R.: Algebraic geometry of codes. In: Handbook of Coding Theory, vols. I, II, pp. 871–961. North-Holland, Amsterdam (1998).
Kirfel C., Pellikaan R.: The minimum distance of codes in an array coming from telescopic semigroups. IEEE Trans. Inform. Theory 41(6, part 1), 1720–1732 (1995). Special issue on algebraic geometry codes.
Munuera C., Torres F.: A note on the order bound on the minimum distance of AG codes and acute semigroups. Adv. Math. Commun. 2(2), 175–181 (2008)
O’Sullivan M.E.: A generalization of the Berlekamp-Massey-Sakata algorithm. Unpublished article (2001).
Pellikaan R., Torres F.: On Weierstrass semigroups and the redundancy of improved geometric Goppa codes. IEEE Trans. Inform. Theory 45(7), 2512–2519 (1999)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Peter Wild.
Rights and permissions
About this article
Cite this article
Bras-Amorós, M. On numerical semigroups and the redundancy of improved codes correcting generic errors. Des. Codes Cryptogr. 53, 111–118 (2009). https://doi.org/10.1007/s10623-009-9297-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-009-9297-8