A displacement approach to efficient decoding of algebraic-geometric codes

DOI10.1145/301250.301311zbMath1345.94104OpenAlexW2022022631MaRDI QIDQ2819550

Vadim Olshevsky, Mohammad Amin Shokrollahi

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301311

Mathematics Subject Classification ID

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

Related Items

Computing minimal interpolation bases, Computations with quasiseparable polynomials and matrices, Structured matrices and Newton's iteration: unified approach, A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations, Superfast algorithms for Cauchy-like matrix computations and extensions, An efficient solution for Cauchy-like systems of linear equations, Key equations for list decoding of Reed-Solomon codes and how to solve them, Asymmetric code-theoretical schemes constructed with the use of algebraic geometric codes