The Order Bound on the Minimum Distance of the One-Point Codes Associated to the Garcia–Stichtenoth Tower

DOI10.1109/TIT.2007.907522MaRDI QIDQ3548800zbMATH OpenWikidataFDO

Authors Maria Bras-Amorós, Michael E. O'Sullivan

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2007.907522

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Other types of codes (94B60)

Recommendations

• A sequence of one-point codes from a tower of function fields
• On a tower of Garcia and Stichtenoth
• On the order bounds for one-point AG codes
• Goppa-like bounds for the generalized Feng-Rao distances
• Goppa-like bounds for the generalized Feng-Rao distances.

Cited in

(4)

• Bounding the number of \(\mathbb F_q\)-rational places in algebraic function fields using Weierstrass semigroups
• A sequence of one-point codes from a tower of function fields
• An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps
• Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower

This page was built for publication: The Order Bound on the Minimum Distance of the One-Point Codes Associated to the Garcia–Stichtenoth Tower

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548800)