Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
From MaRDI portal
Publication:4544476
Recommendations
Cited in
(13)- A method of constructing linear mapping families to achieve the asymptotic GV bound
- scientific article; zbMATH DE number 4112532 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2127878 (Why is no real title available?)
- A goppa-like bound on the trellis state complexity of algebraic-geometric codes
- On improved asymptotic bounds for codes from global function fields
- scientific article; zbMATH DE number 4104859 (Why is no real title available?)
- Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
- Further improvements on asymptotic bounds for codes using distinguished divisors
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)