Parameter choices on Guruswami--Sudan algorithm for polynomial reconstruction

Authors:
Wang Mingsheng
Affiliations:
Information Security Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing 100080, PO Box 8718, China
Venue:
Finite Fields and Their Applications
Year:
2007

Citing 5
Cited 1

Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity
Modern computer algebra

Modern computer algebra
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract)

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Limits to list decoding Reed-Solomon codes

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory

Parameter choices and a better bound on the list size in the Guruswami---Sudan algorithm for algebraic geometry codes

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Guruswami-Sudan algorithm for polynomial reconstruction problem plays an important role in the study of error-correcting codes. In this paper, we study new better parameter choices in Guruswami-Sudan algorithm for the polynomial reconstruction problem. As a consequence, our result gives a better upper bound for the number of solutions for the polynomial reconstruction problem comparing with the original algorithm.