On the generalized Feng-Rao numbers of numerical semigroups generated by intervals

Delgado, M.; Farrán, J.; García-Sánchez, P.; Llena, D.

doi:10.1090/S0025-5718-2013-02673-7

On the generalized Feng-Rao numbers of numerical semigroups generated by intervals
HTML articles powered by AMS MathViewer

by M. Delgado, J. I. Farrán, P. A. García-Sánchez and D. Llena;

Math. Comp. 82 (2013), 1813-1836

DOI: https://doi.org/10.1090/S0025-5718-2013-02673-7

Published electronically: January 28, 2013

PDF | Request permission

Abstract:

We give some general results concerning the computation of the generalized Feng-Rao numbers of numerical semigroups. In the case of a numerical semigroup generated by an interval, a formula for the $r^{\mathrm {th}}$ Feng-Rao number is obtained.

References

Angela I. Barbero and Carlos Munuera, The weight hierarchy of Hermitian codes, SIAM J. Discrete Math. 13 (2000), no. 1, 79–104. MR 1737936, DOI 10.1137/S089548019834342X
A. Campillo and J. I. Farrán, Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models, Finite Fields Appl. 6 (2000), no. 1, 71–92. MR 1738217, DOI 10.1006/ffta.1999.0266
Antonio Campillo, José Ignacio Farrán, and Carlos Munuera, On the parameters of algebraic-geometry codes related to Arf semigroups, IEEE Trans. Inform. Theory 46 (2000), no. 7, 2634–2638. MR 1806823, DOI 10.1109/18.887872
S. T. Chapman, P. A. García-Sánchez, and D. Llena, The catenary and tame degree of numerical monoids, Forum Math. 21 (2009), no. 1, 117–129. MR 2494887, DOI 10.1515/FORUM.2009.006
M. Delgado, P. A. García-Sánchez and J. Morais, “NumericalSgps”, A GAP package for numerical semigroups, current version number 0.97 (2011). Available via http://www.gap-system.org/.
J. I. Farrán, P. A. García-Sánchez and D. Llena, “On the Feng-Rao numbers”, Actas de las VII Jornadas de Matemática Discreta y Algorítmica, pp. 321-333 (2010).
J. I. Farrán and C. Munuera, Goppa-like bounds for the generalized Feng-Rao distances, Discrete Appl. Math. 128 (2003), no. 1, 145–156. International Workshop on Coding and Cryptography (WCC 2001) (Paris). MR 1991422, DOI 10.1016/S0166-218X(02)00441-9
Gui Liang Feng and T. R. N. Rao, Decoding algebraic-geometric codes up to the designed minimum distance, IEEE Trans. Inform. Theory 39 (1993), no. 1, 37–45. MR 1211489, DOI 10.1109/18.179340
Petra Heijnen and Ruud Pellikaan, Generalized Hamming weights of $q$-ary Reed-Muller codes, IEEE Trans. Inform. Theory 44 (1998), no. 1, 181–196. MR 1486657, DOI 10.1109/18.651015
Tor Helleseth, Torleiv Kløve, and Johannes Mykkeltveit, The weight distribution of irreducible cyclic codes with block length $n_{1}((q^{l}-1)/N)$, Discrete Math. 18 (1977), no. 2, 179–211. MR 446717, DOI 10.1016/0012-365X(77)90078-4
Tom Høholdt, Jacobus H. van Lint, and Ruud Pellikaan, Algebraic geometry codes, Handbook of coding theory, Vol. I, II, North-Holland, Amsterdam, 1998, pp. 871–961. MR 1667946
Christoph Kirfel and Ruud Pellikaan, The minimum distance of codes in an array coming from telescopic semigroups, IEEE Trans. Inform. Theory 41 (1995), no. 6, 1720–1732. Special issue on algebraic geometry codes. MR 1391031, DOI 10.1109/18.476245
J. C. Rosales and P. A. García-Sánchez, “Numerical Semigroups”, Developments in Maths. vol. 20, Springer (2010).
Victor K. Wei, Generalized Hamming weights for linear codes, IEEE Trans. Inform. Theory 37 (1991), no. 5, 1412–1418. MR 1136673, DOI 10.1109/18.133259