DocumentCode
1975809
Title
List Decoding in Average-Case Complexity and Pseudorandomness
Author
Guruswami, Venkatesan
Author_Institution
Department of Computer Science and Engineering University of Washington Seattle, WA, U.S.A. Email: venkat@cs.washington.edu
fYear
2006
fDate
13-17 March 2006
Firstpage
32
Lastpage
36
Abstract
This is a brief survey into the applications of list decoding in complexity theory, specifically in relating the worst-case and average-case complexity of computational problems, and in construction of pseudorandom generators. Since we do not have space for full proofs, the aim is to give a flavor of the utility of list decoding in these settings together with pointers to where further details can be found.
Keywords
Application software; Circuit noise; Complexity theory; Computational modeling; Computer science; Decoding; Error correction codes; Noise generators; Polynomials; Reed-Solomon codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2006. ITW '06 Punta del Este. IEEE
Conference_Location
Punta del Este, Uruguay
Print_ISBN
1-4244-0035-X
Electronic_ISBN
1-4244-0036-8
Type
conf
DOI
10.1109/ITW.2006.1633776
Filename
1633776
Link To Document