Algebraic geometry codes with good asymptotic parameters
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5235443
- Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
- scientific article; zbMATH DE number 3793939
- The asymptotic theory of algebraic-geometry codes
- scientific article; zbMATH DE number 4104859
Cited in
(8)- An exhaustion bound for algebraic-geometric ``modular codes
- Algebraic-geometric codes and asymptotic problems
- Asymptotically good codes from generalized algebraic-geometry codes
- The asymptotic theory of algebraic-geometry codes
- scientific article; zbMATH DE number 4104859 (Why is no real title available?)
- Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
- 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
This page was built for publication: Algebraic geometry codes with good asymptotic parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452816)
