On the decoding of algebraic-geometric codes
From MaRDI portal
Publication:5966597
DOI10.1109/18.57204zbMath0738.94020WikidataQ57395865 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
binary codes; algebraic curves; Gilbert-Varshamov bound; elliptic and hyperelliptic curves; Blokh-Zyablov bound; decoding algorithm for algebraic-geometric codes; polynomial decoding
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
94B35: Decoding
Related Items
Decoding by rank-2 bundles over plane quartics, Improved evaluation codes defined by plane valuations, Algebraic-geometric codes and asymptotic problems, On decoding by error location and dependent sets of error positions, Evaluation codes defined by finite families of plane valuations at infinity