Further improvements on asymptotic bounds for codes using distinguished divisors

Niederreiter H., Ozbudak F.

FINITE FIELDS AND THEIR APPLICATIONS, cilt.13, sa.3, ss.423-443, 2007 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 13 Sayı: 3
  • Basım Tarihi: 2007
  • Doi Numarası: 10.1016/j.ffa.2005.11.004
  • Dergi Adı: FINITE FIELDS AND THEIR APPLICATIONS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.423-443
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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) 2005 Elsevier Inc. All rights reserved.