On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes

Analysis of the Berlekamp-Massey-Sakata algorithm for decoding one-point codes leads to two methods for improving code rate. One method, due to Feng and Rao, removes parity checks that may be recovered by their majority voting algorithm. The second method is to design the code to correct only those error vectors of a given weight that are also geometrically generic. In this work, formulae are given for the redundancies of Hermitian codes optimized with respect to these criteria as well as the formula for the order bound on the minimum distance. The results proceed from an analysis of numerical semigroups generated by two consecutive integers.

[1]  Johan P. Hansen,et al.  Algebraic Geometry Codes , 2005 .

[2]  Carlos Munuera,et al.  The Second and Third Generalized Hamming Weights of Hermitian Codes , 1999, IEEE Trans. Inf. Theory.

[3]  L. Welch,et al.  Improved geometric Goppa codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[4]  Ruud Pellikaan,et al.  On Weierstrass semigroups and the redundancy of improved geometric Goppa codes , 1999, IEEE Trans. Inf. Theory.

[5]  Shojiro Sakata,et al.  Extension of the Berlekamp-Massey Algorithm to N Dimensions , 1990, Inf. Comput..

[6]  Ruud Pellikaan,et al.  On decoding by error location and dependent sets of error positions , 1992, Discret. Math..

[8]  José Ignacio Farrán,et al.  Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models , 1999, ArXiv.

[9]  T. R. N. Rao,et al.  Decoding algebraic-geometric codes up to the designed minimum distance , 1993, IEEE Trans. Inf. Theory.

[10]  Iwan M. Duursma,et al.  Majority coset decoding , 1993, IEEE Trans. Inf. Theory.

[11]  Ian F. Blake,et al.  Algebraic-Geometry Codes , 1998, IEEE Trans. Inf. Theory.

[12]  Olav Geil,et al.  On codes from norm-trace curves , 2003 .

[13]  M. Wodzicki.  Lecture Notes in Math , 1984 .

[14]  Ruud Pellikaan,et al.  The minimum distance of codes in an array coming from telescopic semigroups , 1995, IEEE Trans. Inf. Theory.

[15]  Henning Stichtenoth,et al.  A note on Hermitian codes over GF(q2) , 1988, IEEE Trans. Inf. Theory.

[16]  P. V. Kumar,et al.  On the true minimum distance of Hermitian codes , 1992 .

[17]  J. C. Rosales,et al.  Numerical semigroups generated by intervals , 1999 .

[18]  T. R. N. Rao,et al.  Improved geometric Goppa codes. I. Basic theory , 1995, IEEE Trans. Inf. Theory.

[19]  Tom Høholdt,et al.  Performance analysis of a decoding algorithm for algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[20]  Johan P. Hansen,et al.  Dependent rational points on curves over finite fields - Lefschetz theorems and exponential sums , 2001, Electron. Notes Discret. Math..

[21]  Maria Bras-Amorós,et al.  The Correction Capability of the Berlekamp–Massey–Sakata Algorithm with Majority Voting , 2006, Applicable Algebra in Engineering, Communication and Computing.

[22]  T. R. N. Rao,et al.  A simple approach for construction of algebraic-geometric codes from affine plane curves , 1993, IEEE Trans. Inf. Theory.