Topics for Essential Coding Theory (MIT 6.440):
Mathematical Theory of Communication (by Claude Shannon).
of the Gilbert-Varshamov Bound on the Size of Binary Codes
(by Tao Jiang and Alexander Vardy).
Gilbert-Varshamov bounds for q-ary codes (by Van Vu and
Lei Wu). Project
Codes Exceeding the Gilbert - Varshamov Bound for any Fixed
Distance (by Sergey Yekhanin and Ilya Dumer). Project unassigned.
Theorems and Error-Correcting Codes (by Joel Friedman and
bounds for codes via a covering argument (by Michael Navon
and Alex Samorodnitsky). Project
tower of Artin-Schreier extensions of function fields
attaining the Drinfeld-Vladut bound (by A. Garcia and H.
for List Decoding (by V. Guruswami, J. Hastad, M. Sudan
and D. Zuckerman).
list decodability of linear codes (by V. Guruswami). Project unassigned.
Polynomials and List Decoding of Reed-Solomon Codes (by E.
Ben-Sasson, S. Kopparty and J. Radhakrishnan). Project unassigned.
List Decoding Reed-Solomon Codes (by V. Guruswami and A.
Rudra). Project assigned (Sam E. &
of Reed-Solomon Codes is NP-hard (by V. Guruswami and A.
of approximating the closest vector problem with
pre-processing (by Michael Alekhnovich, Subhash Khot, Guy
Kindler, Nisheeth Vishnoi). Project unassigned.
Equations over Polynomials and Soft Decoding of Reed-Solomon
Codes (by Michael Alekhnovich). Project
assigned (Tana & Pasin).
without the XOR lemma (by M. Sudan, L. Trevisan, and S.
Vadhan). Project assigned (Sam W. &
Pseudorandom Generators (by L. Trevisan). Project assigned (George & Tim).
and Randomness Extractors from Parvaresh-Vardy Codes (by
Venkatesan Guruswami, Christopher Umans, and Salil Vadhan). Project unassigned.
Meets Euclid: the Approximability of Geometric TSP and MST
(by Luca Trevisan). Project
assigned (Jon & Josh). Link broken - to be updated.
Locally Decodable Codes of Subexponential Length (by
Sergey Yekhanin). 3-Query
Locally Decodable Codes of Subexponential Length (Klim
Evasive Sets (by Zeev Dvir and Shachar Lovett). Project assigned (Efrat & Chiheon).
- How to construct
Polar Codes. (by Ido Tal and Alexander Vardy). Project unassigned.
- Coding for Errors
and Erasures in Random Network Coding (by Ralf Koetter
and Frank Kschischang). Project
assigned (Mina & Ali).
Quantum algebraic geometry codes (by Chiu Fan Lee). Project assigned (Alan &
List-decoding Reed Muller Codes (by Parikshit Gopalan,
Adam Klivans and David Zuckerman). Project assigned (Mohammad & Badih).
- Coding for
interactive communication (by Zvika Brakerski and Yael
Kalai). Project assigned
(Mohsen & Zonghao).