Unique Decoding of Plane AG Codes via Interpolation

DOI10.1109/TIT.2012.2182757MaRDI QIDQ5271923zbMATH OpenOpenAlexWikidataFDO

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

Publication date 12 July 2017

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

Full work available at URL https://arxiv.org/abs/1110.6251

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) Decoding (94B35)

Abstract: We present a unique decoding algorithm of algebraic geometry codes on plane curves, Hermitian codes in particular, from an interpolation point of view. The algorithm successfully corrects errors of weight up to half of the order bound on the minimum distance of the AG code. The decoding algorithm is the first to combine some features of the interpolation based list decoding with the performance of the syndrome decoding with majority voting scheme. The regular structure of the algorithm allows a straightforward parallel implementation.

Cited in

(6)

• Computational aspects of retrieving a representation of an algebraic geometry code
• Feng-Rao decoding of primary codes
• On the evaluation codes given by simple \(\delta \)-sequences
• Unique Decoding of General AG Codes
• List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
• Higher-genus McEliece

This page was built for publication: Unique Decoding of Plane AG Codes via Interpolation

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