Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
From MaRDI portal
Publication:4544476
DOI10.1109/18.904533zbMath1019.94036OpenAlexW2166136033MaRDI QIDQ4544476
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.904533
Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Related Items (3)
Further improvements on asymptotic bounds for codes using distinguished divisors ⋮ Nonlinear codes with asymptotic parameters better than the Gilbert-Varshamov and the Xing bounds ⋮ On improved asymptotic bounds for codes from global function fields
This page was built for publication: Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds