You may find this
text by Guruswamy, Rudra and Sudan useful as a reference.
| Date |
Topics |
Links |
| September 25 |
Introduction
|
pdf |
| September 30 |
More limits on codes
|
pdf |
| October 1 |
The volume bound and finite fields
|
pdf |
| October 6 |
Exercise list 1
|
pdf |
| October 7 |
Reed-Solomon codes
|
pdf |
| October 9 |
Expander codes
|
pdf |
| October 14 |
Expander codes: Tanner Codes
|
pdf |
| October 16 |
List decoding and Tree codes
|
pdf |
| October 21 |
Local codes
|
pdf |
| October 23 |
Matching vector codes
|
pdf |
| October 28 |
Polar codes
|
pdf |
| October 30 |
Matching vector families
|
pdf |
| November 4 |
Polynomials representing OR mod m
|
pdf |
| November 6 |
LDC lower bounds
|
pdf |
| November 13 |
Exponential 2-query LDC lower bound
|
pdf |
| November 13 |
Exercise list 2
|
pdf |
| November 18 |
Local codes for distributed storage
|
pdf |
Student Presentations
| Date |
Topic |
Presenters |
| November 20 |
Multiplicity codes
|
Victor, Bill, Siddharth |
| November 25 |
2-server private information retreival
|
Ashrujit, Helgi, Ellis |
| November 27 |
Near optimal epsilon-biased sets
|
Tarik, Aditya, Kuikui |
| December 2 |
Reed-Muller codes achieve capacity over erasure channels
|
Nathan, Oscar, Melissa |
| December 4 |
From irreducible representations to locally decodable codes
|
Ji, Xihu, Samuel |