Fast decoding of algebraic-geometric codes up to the designed minimum distance
From MaRDI portal
Publication:4880292
DOI10.1109/18.476240zbMath0847.94013OpenAlexW2034321633MaRDI QIDQ4880292
Helge Elbrond Jensen, Y. Madelung, Shojiro Sakata, Tom Høholdt, Jørn Justesen
Publication date: 13 August 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cc07895a93087f256671cbf317d7dec218cf38ca
algebraic-geometric codesdecodingBerlekamp-Massey algorithmHermitian curveSakata algorithmFeng-Rao scheme
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Related Items
On the evaluation codes given by simple \(\delta \)-sequences, Aggregate error locator and error value computation in AG codes, Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes, Evaluation codes defined by finite families of plane valuations at infinity, List decoding algorithm based on voting in Gröbner bases for general one-point AG codes, Asymmetric code-theoretical schemes constructed with the use of algebraic geometric codes
