Further improvements on asymptotic bounds for codes using distinguished divisors

Authors:
Harald Niederreiter;Ferruh ÖZbudak
Affiliations:
Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore 117543, Republic of Singapore;Department of Mathematics, Middle East Technical University, İnönü Bulvarı, 06531 Ankara, Turkey
Venue:
Finite Fields and Their Applications
Year:
2007

Citing 6
Cited 2

Excellent codes from modular curves

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Rational Points on Curves over Finite Fields: Theory and Applications

Rational Points on Curves over Finite Fields: Theory and Applications
Algebraic-Geometric Codes

Algebraic-Geometric Codes
Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds

IEEE Transactions on Information Theory
Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound

IEEE Transactions on Information Theory
Excellent nonlinear codes from algebraic function fields

IEEE Transactions on Information Theory

On improved asymptotic bounds for codes from global function fields

Designs, Codes and Cryptography
Improvements on parameters of algebraic-geometry codes from Hermitian curves

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

For a prime power q, let @a"q be the standard function in the asymptotic theory of codes, that is, @a"q(@d) is the largest asymptotic information rate that can be achieved for a given asymptotic relative minimum distance @d of q-ary codes. In recent years the Tsfasman-Vladut-Zink lower bound on @a"q(@d) was improved by Elkies, Xing, and Niederreiter and Ozbudak. In this paper we show further improvements on these bounds by using distinguished divisors of global function fields.