On improved asymptotic bounds for codes from global function fields
From MaRDI portal
(Redirected from Publication:1035803)
Recommendations
- Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields
- Further improvements on asymptotic bounds for codes using distinguished divisors
- Towers of Global Function Fields with Asymptotically Many Rational Places and an Improvement on the Gilbert - Varshamov Bound
- scientific article; zbMATH DE number 4104859
- Asymptotically good codes
Cites work
- A Note on Further Improvements of the TVZ-Bound
- Algebraic function fields and codes
- Algebraic-geometric codes and asymptotic problems
- Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds
- An exhaustion bound for algebraic-geometric ``modular codes
- An explicit tower of function fields over cubic finite fields and Zink’s lower bound
- Excellent Nonlinear Codes From Algebraic Function Fields
- Further improvements on asymptotic bounds for codes using distinguished divisors
- scientific article; zbMATH DE number 3836211 (Why is no real title available?)
- scientific article; zbMATH DE number 2127878 (Why is no real title available?)
- scientific article; zbMATH DE number 3803619 (Why is no real title available?)
- Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
- Rational points on curves over finite fields. Theory and Applications
Cited in
(8)- Further improvements on asymptotic bounds for codes using distinguished divisors
- A computability challenge: asymptotic bounds for error-correcting codes
- A Construction of Permutation Codes From Rational Function Fields and Improvement to the Gilbert–Varshamov Bound
- scientific article; zbMATH DE number 2127878 (Why is no real title available?)
- Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields
- Asymptotically good codes
- Construction of global function fields from linear codes and vice versa
- New lower bounds for the Ihara function A(q) for small primes
This page was built for publication: On improved asymptotic bounds for codes from global function fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035803)