Please use this identifier to cite or link to this item: https://doi.org/10.1137/060674478
Title: Improved asymptotic bounds for codes using distinguished divisors of global function fields
Authors: Niederreiter, H. 
Özbudak, F.
Keywords: Asymptotic theory of codes
Gilbert-Varshamov bound
Global function fields
Tsfasman-Vlǎduţ;- Zink bound
Xing bound
Issue Date: 2007
Source: Niederreiter, H., Özbudak, F. (2007). Improved asymptotic bounds for codes using distinguished divisors of global function fields. SIAM Journal on Discrete Mathematics 21 (4) : 865-899. ScholarBank@NUS Repository. https://doi.org/10.1137/060674478
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, 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 αqlin for linear codes. © 2007 Society for Industrial and Applied Mathematics.
Source Title: SIAM Journal on Discrete Mathematics
URI: http://scholarbank.nus.edu.sg/handle/10635/103404
ISSN: 08954801
DOI: 10.1137/060674478
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

6
checked on Feb 13, 2018

WEB OF SCIENCETM
Citations

9
checked on Jan 10, 2018

Page view(s)

25
checked on Feb 18, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.