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.904533zbMATH Open1019.94036OpenAlexW2166136033MaRDI QIDQ4544476FDOQ4544476
Authors: Chaoping Xing 
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
Recommendations
Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cited In (13)
- Title not available (Why is that?)
- Excellent Nonlinear Codes From Algebraic Function Fields
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
- Nonlinear codes with asymptotic parameters better than the Gilbert-Varshamov and the Xing bounds
- The asymptotic theory of algebraic-geometry codes
- Algebraic geometry codes with good asymptotic parameters
- Title not available (Why is that?)
- A goppa-like bound on the trellis state complexity of algebraic-geometric codes
- On improved asymptotic bounds for codes from global function fields
- Title not available (Why is that?)
- Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
- Further improvements on asymptotic bounds for codes using distinguished divisors
- A method of constructing linear mapping families to achieve the asymptotic GV bound
This page was built for publication: Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544476)
