Improved decoding of Reed-Solomon and algebraic-geometric codes

DOI10.1109/SFCS.1998.743426MaRDI QIDQ6909517zbMATH OpenFDO

Authors Venkatesan Guruswami, Madhu Sudan

Publication date 29 October 2025

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

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(12)

• Traceable bottom-up secret sharing and law and order on community social key recovery
• Traceable verifiable random functions
• Search-to-decision reductions for Kolmogorov complexity
• On the degree of polynomials computing square roots p
• Point-polynomial incidences theorem with an application to Reed-Solomon codes
• Derandomization via symmetric polytopes: poly-time factorization of certain sparse polynomials
• Secret and shared keys recovery on Hamming quasi-cyclic with SASCA
• On the structure of the Schur squares of twisted generalized Reed-Solomon codes and application to cryptanalysis
• Counterexamples to the low-degree conjecture
• List-decodable Byzantine robust PIR: lower communication complexity, higher Byzantine tolerance, smaller list size
• Decoding GAG codes beyond half the Özbudak-Stichtenoth bound
• Understanding binary-Goppa decoding

This page was built for publication: Improved decoding of Reed-Solomon and algebraic-geometric codes

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