Please use this identifier to cite or link to this item:
|Title:||Further improvements on asymptotic bounds for codes using distinguished divisors|
|Authors:||Niederreiter, H. |
|Keywords:||Asymptotic theory of codes|
|Source:||Niederreiter, H., Özbudak, F. (2007-07). Further improvements on asymptotic bounds for codes using distinguished divisors. Finite Fields and their Applications 13 (3) : 423-443. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ffa.2005.11.004|
|Abstract:||For a 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 for a given asymptotic relative minimum distance δ of q-ary codes. In recent years the Tsfasman-Vlǎduţ-Zink lower bound on αq (δ) was improved by Elkies, Xing, and Niederreiter and Özbudak. In this paper we show further improvements on these bounds by using distinguished divisors of global function fields. © 2005 Elsevier Inc. All rights reserved.|
|Source Title:||Finite Fields and their Applications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 15, 2018
WEB OF SCIENCETM
checked on Feb 5, 2018
checked on Feb 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.