Algebraic geometry codes with good asymptotic parameters

zbMATH Open1141.94398MaRDI QIDQ5452816FDOQ5452816

Authors: Wan-bao Hu 

Publication date: 4 April 2008

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

zbMATH Keywords

Gilbert-Varshamov boundXing bound

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited In (7)

• 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
• An exhaustion bound for algebraic-geometric ``modular codes
• Title not available (Why is that?)
• Asymptotically good codes from generalized algebraic-geometry codes
• Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink 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)