Further improvements on asymptotic bounds for codes using distinguished divisors

DOI10.1016/j.ffa.2005.11.004zbMath1124.94017OpenAlexW1981817947MaRDI QIDQ2370632

Ferruh Özbudak, Harald Niederreiter

Publication date: 29 June 2007

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2005.11.004

zbMATH Keywords

global function fieldGilbert-Varshamov boundnonlinear codeasymptotic theory of codesTsfasman-Vlǎduţ-Zink bound

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

On improved asymptotic bounds for codes from global function fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic function fields and codes
• An exhaustion bound for algebraic-geometric ``modular codes
• Excellent Nonlinear Codes From Algebraic Function Fields
• Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
• Excellent codes from modular curves
• An explicit tower of function fields over cubic finite fields and Zink’s lower bound

This page was built for publication: Further improvements on asymptotic bounds for codes using distinguished divisors