论文信息 - Minimum distance of Hermitian two-point codes - 字舞流文

Minimum distance of Hermitian two-point codes

We prove a formula for the minimum distance of two-point codes on a Hermitian curve.

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

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

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

[4] Carlos Munuera,et al. Near Orders and Codes , 2007, IEEE Transactions on Information Theory.

[5] Masaaki Homma,et al. The Two-Point Codes on a Hermitian Curve with the Designed Minimum Distance , 2006, Des. Codes Cryptogr..

[6] Peter Beelen,et al. The order bound for general algebraic geometric codes , 2007, Finite Fields Their Appl..

[7] Richard M. Wilson,et al. On the minimum distance of cyclic codes , 1986, IEEE Trans. Inf. Theory.

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

[9] Masaaki Homma,et al. The Complete Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve , 2006, Des. Codes Cryptogr..

[10] Gr Ruud Pellikaan,et al. The shift bound for cyclic, Reed-Muller and geometric Goppa codes , 1996 .

[11] Masaaki Homma,et al. Toward the Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve , 2005, Des. Codes Cryptogr..

[12] Masaaki Homma,et al. The Two-Point Codes with the Designed Distance on a Hermitian Curve in Even Characteristic , 2006 .