Rational Points on Curves over Finite Fields: Theory and Applications
Rational Points on Curves over Finite Fields: Theory and Applications
Algebraic-Geometric Codes
Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields
SIAM Journal on Discrete Mathematics
Algebraic Function Fields and Codes
Algebraic Function Fields and Codes
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
A Note on Further Improvements of the TVZ-Bound
IEEE Transactions on Information Theory
Further improvements on asymptotic bounds for codes using distinguished divisors
Finite Fields and Their Applications
Hi-index | 0.00 |
For an arbitrary prime power q, let αq be the standard function in the asymptotic theory of codes, that is, αq(δ) is the largest asymptotic information rate that can be achieved by a sequence of q-ary codes with a given asymptotic relative minimum distance δ. A central problem in the asymptotic theory of codes is to find lower bounds on αq(δ). In recent years several authors established various lower bounds on αq(δ). In this paper, we present a further improved lower bound by extending a result of Niederreiter and Özbudak (Finite Fields Appl 13: 423---443, 2007). In particular, we show that the bound 1 - δ - A(q)-1 + logq (1 + 2/q3) + logq (1 + (q - 1)/q6) can be achieved for certain values of q and certain ranges of δ.