= Venkatesan Guruswami
{c}
{wiki}
<Venkatesan Guruswami> is a <computer scientist> whose research includes <coding theory>, <computational complexity theory>, <pseudorandomness> and the complexity of approximate optimization. A major focus is <list decoding> of <error-correcting codes>.<Venkatesan Guruswami's Berkeley research homepage>[Research, error-correcting codes and list decoding]{ref}
Ordinary unique decoding aims to recover one transmitted message; <list decoding> permits a bounded list of candidate messages when the received word has too many errors for uniqueness. The resulting questions connect the amount of redundancy in a <error-correcting code> with how much corruption can be handled efficiently. His research profile also describes work on approximate solutions to problems with <NP-hardness>.<Venkatesan Guruswami's Berkeley research homepage>[Research, list decoding with optimal redundancy and approximate solutions to NP-hard problems]{ref}
Identity source: https://theory.cs.berkeley.edu/
\Image[https://people.eecs.berkeley.edu/~venkatg/pic/Venkat-Guruswami-2021.jpg]
{title=Portrait of <Venkatesan Guruswami>}
{description=Photograph from University of California, Berkeley's official researcher profile.}
{source=https://people.eecs.berkeley.edu/~venkatg/}
{width=260}
Back to article page
