Nonlinear codes from points of bounded height

DOI10.1016/J.FFA.2005.11.001zbMATH Open1176.94076OpenAlexW2065730712MaRDI QIDQ946879FDOQ946879

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An adelic Minkowski-Hlawka theorem and an application to Siegel's lemma.
• Excellent codes from modular curves

Cited In (6)

• Codes from infinitely near points
• A Note on Nonlinear Xing Codes
• Distance-invariant error control codes from combinatorial designs
• Title not available (Why is that?)
• An introduction to robust codes over finite fields
• Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman–VlĂduŢ–Zink Bound

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)