论文信息 - Algebraic algorithms and coding theory - 字舞流文

Algebraic algorithms and coding theory

The associated talk surveys some recent developments in algorithmic coding theory that answer some fundamental questions with algebraic techniques.

Madhu Sudan | M. Sudan

[1] E. Berlekamp. Factoring polynomials over large finite fields , 1970 .

[2] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[3] M. Tsfasman,et al. Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound , 1982 .

[4] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[5] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[6] I. Reed,et al. Polynomial Codes Over Certain Finite Fields , 1960 .

[7] Dwijendra K. Ray-Chaudhuri,et al. Binary mixture flow with free energy lattice Boltzmann methods , 2022, arXiv.org.

[8] Alexander Vardy,et al. Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[9] Madhu Sudan,et al. Reconstructing curves in three (and higher) dimensional space from noisy data , 2003, STOC '03.

[10] Irina Adjudeanu,et al. Codes correcteurs d'erreurs LDPC structurés , 2010 .

[11] Christopher Umans,et al. Fast polynomial factorization and modular composition in small characteristic , 2008, STOC.