<--- Back to Details
First PageDocument Content
Applied mathematics / Mathematics / Computational complexity theory / Information theory / List decoding / Venkatesan Guruswami / ACM SIGACT / Computer science / Hardness of approximation / Error detection and correction / Theoretical computer science / Coding theory
Date: 2013-11-15 13:27:20
Applied mathematics
Mathematics
Computational complexity theory
Information theory
List decoding
Venkatesan Guruswami
ACM SIGACT
Computer science
Hardness of approximation
Error detection and correction
Theoretical computer science
Coding theory

Curriculum Vitae Venkatesan Guruswami Webpage: www.cs.cmu.edu/~ venkatg Email: [removed]

Add to Reading List

Source URL: www.cs.cmu.edu

Download Document from Source Website

File Size: 299,51 KB

Share Document on Facebook

Similar Documents

Bounds on List Decoding of Rank Metric Codes Antonia Wachter-Zeh Institute of Communications Engineering, Ulm University, Ulm, Germany and Institut de Recherche Math´ ematique de Rennes (IRMAR), Universit´

DocID: 1vnJD - View Document

A Complete List of Genes, Binary Decoding Tapes, and Decimal Codes of the 1882 LSBF that Can be Realized via a CNN of Four Input Variables FANGYUE CHEN ∗

DocID: 1vnvL - View Document

INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE List-decoding of binary Goppa codes up to the binary Johnson bound Daniel Augot — Morgan Barbier — Alain Couvreur

DocID: 1uEKU - View Document

Universal compression, list decoding, and logarithmic loss Yanina Shkel, Maxim Raginsky, and Sergio Verd´u Abstract—Universal lossy source coding under the logarithmic loss (log-loss) criterion is studied. Bounds on t

DocID: 1uxOt - View Document

1 Bounds on List Decoding Gabidulin Codes Antonia Wachter-Zeh Institute of Communications Engineering, Ulm University, Ulm, Germany and Institut de Recherche Math´ematique de Rennes, Universit´e de Rennes 1, Rennes, F

DocID: 1u4uQ - View Document