论文信息 - Excellent nonlinear codes from algebraic function fields

Excellent nonlinear codes from algebraic function fields

The Gilbert-Varshamov (GV) bound for asymptotic families of codes over F/sub q/ has been improved by Tsfasman, Vla/spl breve/dut$80, and Zink (TVZ) in 1982, and only recently further improvements have been obtained by Xing, Elkies, and Niederreiter-O/spl uml/zbudak, by considering also nonlinear codes. These improvements involve higher derivations in function fields and are very computational. We give in this correspondence a much simpler proof for those improvements. Our construction of asymptotically good nonlinear codes is very similar to Goppa's construction of algebraic-geometry codes.

Chaoping Xing | Henning Stichtenoth | C. Xing | H. Stichtenoth

[1] Chaoping Xing,et al. Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound , 2003, IEEE Transactions on Information Theory.

[2] Chaoping Xing,et al. Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds , 2001, IEEE Trans. Inf. Theory.

[3] Henning Stichtenoth,et al. Algebraic function fields and codes , 1993, Universitext.

[4] Noam D. Elkies,et al. Excellent nonlinear codes from modular curves , 2001, STOC 2001.

[5] Noam D. Elkies,et al. Still better nonlinear codes from modular curves , 2003, math/0308046.

[6] H. Niederreiter,et al. "Coding, Cryptography and Combinatorics" , 2012 .

[7] M. Tsfasman,et al. Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound , 1982 .

[8] S. G. Vladut,et al. Algebraic-Geometric Codes , 1991 .