Nonlinear codes from points of bounded height

DOI10.1016/J.FFA.2005.11.001MaRDI QIDQ946879zbMATH OpenOpenAlexFDO

Authors Chris Hurlburt, Jeffrey Lin Thunder

Publication date 25 September 2008

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ffa.2005.11.001

zbMATH Keywords

algebraic-geometric codesnonlinear error correcting codes

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman–VlĂduŢ–Zink Bound
• Excellent codes from modular curves
• Excellent Nonlinear Codes From Algebraic Function Fields
• scientific article; zbMATH DE number 3882342
• scientific article; zbMATH DE number 1714653

Cites work

• scientific article; zbMATH DE number 48941 (Why is no real title available?)
• scientific article; zbMATH DE number 903627 (Why is no real title available?)
• An adelic Minkowski-Hlawka theorem and an application to Siegel's lemma.
• Excellent codes from modular curves

Cited in

(6)

• Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman–VlĂduŢ–Zink Bound
• Codes from infinitely near points
• A Note on Nonlinear Xing Codes
• Distance-invariant error control codes from combinatorial designs
• scientific article; zbMATH DE number 1714653 (Why is no real title available?)
• An introduction to robust codes over finite fields

This page was built for publication: Nonlinear codes from points of bounded height

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