Improved asymptotic bounds for codes using distinguished divisors of global function fields

Download
2007-01-01
Niederreiter, Harald
Özbudak, Ferruh
For a prime power q, let alpha(q) be the standard function in the asymptotic theory of codes, that is, alpha(q)(delta) is the largest asymptotic information rate that can be achieved for a given asymptotic relative minimum distance delta of q-ary codes. In recent years the Tsfasman-Vladut-Zink lower bound on alpha(q)(delta) was improved by Elkies, Xing, Niederreiter and Ozbudak, and Maharaj. In this paper we show further improvements on these bounds by using distinguished divisors of global function fields. We also show improved lower bounds on the corresponding function alpha(lin)(q) q for linear codes.
SIAM JOURNAL ON DISCRETE MATHEMATICS

Suggestions

Further improvements on asymptotic bounds for codes using distinguished divisors
Niederreiter, Harald; Özbudak, Ferruh (Elsevier BV, 2007-07-01)
For a prime power q, let alpha(q) be the standard function in the asymptotic theory of codes, that is, alpha(q)(delta) (6) is the largest asymptotic information rate that can be achieved for a given asymptotic relative minimum distance 6 of q-ary codes. In recent years the Tsfasman-VlAduj-Zink lower bound on alpha(q) (delta) 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. (c) 200...
Uniqueness of F-q-quadratic perfect nonlinear maps from F-q3 to F-q(2)
Özbudak, Ferruh (Elsevier BV, 2014-09-01)
Let q be a power of an odd prime. We prove that all F-q-quadratic perfect nonlinear maps from F-q3 to F-q(2) are equivalent. We also give a geometric method to find the corresponding equivalence explicitly.
On some bounds on the minimum distance of cyclic codes over finite fields
Özbudak, Ferruh; YAYLA, Oguz (2015-08-01)
Recently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bounds on the minimum distance of cyclic codes over finite fields. Here we present some results on a generalization of this method. Then we apply it to several examples of cyclic codes and compare some known bounds with the bounds obtained by this generalization.
Inverse Sturm-Liouville Systems over the whole Real Line
Altundağ, Hüseyin; Taşeli, Hasan; Department of Mathematics (2010)
In this thesis we present a numerical algorithm to solve the singular Inverse Sturm-Liouville problems with symmetric potential functions. The singularity, which comes from the unbounded domain of the problem, is treated by considering the limiting case of the associated problem on the symmetric finite interval. In contrast to regular problems which are considered on a finite interval the singular inverse problem has an ill-conditioned structure despite of the limiting treatment. We use the regularization t...
ON THE NUMERICAL EVALUATION OF AN OSCILLATING INFINITE SERIES-III
Tezer, Münevver (Informa UK Limited, 1990-01-01)
An oscillating infinite series involving product of Bessel function J o(x) and an oscillating infinite series involving trigonometric function sin(x) were evaluated and computed numerically in [1] and [2] respectively. In this paper, an oscillating infinite series involving product of exponential, Bessel and trigonometric functions is evaluated. The series is transformed first into the sum of two infinite integrals by using contour integration and then the infinite integral with oscillating integrand is tra...
Citation Formats
H. Niederreiter and F. Özbudak, “Improved asymptotic bounds for codes using distinguished divisors of global function fields,” SIAM JOURNAL ON DISCRETE MATHEMATICS, pp. 865–899, 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35109.