Speaker:
Title:
Abstract: In this talk we survey some of the recent developments in decoding algebraic-geometric codes when the number of errors imposed on codewords is extremely high. Given a received word and a parameter e, these algorithms return, in polynomial time, a list of codewords which contains the original codeword if the number of errors is at most e. We will also briefly discuss applications to cryptography.