Further improvements on asymptotic bounds for codes using distinguished divisors


Niederreiter H., Ozbudak F.

FINITE FIELDS AND THEIR APPLICATIONS, vol.13, no.3, pp.423-443, 2007 (Peer-Reviewed Journal) identifier identifier

  • Publication Type: Article / Article
  • Volume: 13 Issue: 3
  • Publication Date: 2007
  • Doi Number: 10.1016/j.ffa.2005.11.004
  • Journal Name: FINITE FIELDS AND THEIR APPLICATIONS
  • Journal Indexes: Science Citation Index Expanded, Scopus
  • Page Numbers: pp.423-443

Abstract

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.