On the decoding of algebraic-geometric codes

DOI10.1109/18.57204zbMath0738.94020OpenAlexW2985767532WikidataQ57395865 ScholiaQ57395865MaRDI QIDQ5966597

Alexei N. Skorobogatov, S. G. Vleduts

Publication date: 27 June 1992

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

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

zbMATH Keywords

binary codesalgebraic curvesGilbert-Varshamov boundelliptic and hyperelliptic curvesBlokh-Zyablov bounddecoding algorithm for algebraic-geometric codespolynomial decoding

Mathematics Subject Classification ID

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

Related Items (7)

On the evaluation codes given by simple \(\delta \)-sequences ⋮ Evaluation codes defined by finite families of plane valuations at infinity ⋮ Algebraic-geometric codes and asymptotic problems ⋮ On decoding by error location and dependent sets of error positions ⋮ Decoding by rank-2 bundles over plane quartics ⋮ Improved evaluation codes defined by plane valuations ⋮ Power error locating pairs

This page was built for publication: On the decoding of algebraic-geometric codes