## Student Presentations

1. Monday Oct 03. Sushen: Section 2 of Lecture 4. Connection between $d$-disjunct matrix construction and the $k$-restriction problem.
2. Wednesday Oct 05.Hung, Section 1 of Lecture 5. Connection between $d$-disjunct matrix construction and the set-cover problem.
3. Monday Oct 10.Erdong: Section 2 of Lecture 5. Strongly explicit construction of disjunct matrices by concatenating the Reed-Solomon code with the identity code.
4. Wednesday Oct 12. Nguyen: Section 3 of Lecture 5. Derandomizing the Gilbert-Varshamov bound’s probabilistic proof.
5. Monday Oct 17. Jesse. coNP-completeness of testing whether a matrix is separable.
6. Wednesday Oct 19. Shishir. Efficient decoding and the notions of list-disjunct and list separable matrices.
7. Monday Oct 24 Aggrey. Upper bound for list-disjunct matrices. Section 2 of lecture 8.
8. Wednesday Oct 26 Eric. Sections 1 & 2 of lecture 9. Recursive construction of list disjunct matrices
9. Monday Oct 31 Atri. Section 1 of lecture 10. List-decoding and list-recoverable codes
10. Wednesday Nov 02 Nikhil. Section 2 of lecture 10. List disjunct matrices from RS-based list recoverable codes
11. Monday Nov 07 Venkata S. Section 3 of lecture 10. List disjunct matrices from PV-based list recoverable codes
12. Wednesday Nov 09 Utkarsh. Section 1 of lecture 11. (At least up to Theorem 1.1) Condensers, extractors, and codes.
13. Monday Nov 14 Sandeep. Section 1 of lecture 11. (The rest of section 1.) List-disjunct matrices from extractors
14. Wednesday Nov 16 Vikramsinh. Section 2 of lecture 11. List-disjunct matrices from expanders
15. Monday Nov 21  Sujith. Application: explicit monotone encodings.
16. Monday Nov 28 We won’t have any presentation on this day due to the move to the new building
17. Mon Dec 05 Weixian. Error tolerant case, part I.
18. Wed Dec 07 Nikhil. Error tolerant case, part II.