top of page

ACCQ204: Coding Theory

Why coding? Hamming codes, fundamental bounds (Chapters 1,4): info, notes1, HW1, HW1sol

The need for structure, linear codes (Chapter 2): notes2, HW2, HW2sol

MDS codes, Reed-Solomon codes (almost every attribute plus elegance, Chapters 5, 12.1): notes3 (for a refresh on finite fields here), HW3, HW3sol        
Concatenation: A method 1. to translate a code on a given alphabet into some other code over a desired alphabet in Hamming's world, and 2. which allows to achieve capacity with polynomial-time complexity, and exponentially small error probability in Shannon's world (Chapters 10, 14): notes4, HW4, HW4sol

List decoding (a way to decode that puts Hamming's world and Shannon's world on equal footing, Chapter 7): HW5, HW5sol 

Expander codes (superfast decoding, Chapter 11, p. 201-205 -> Thm. 11.2.3, Sections 11.3.1, 11.3.3): notes6, HW6, HW6sol

Polar codes (capacity-achieving, practical, and neat theory, Chapter 16): video, notes7a, 7b, HW7, HW7sol

​
Exam with solutions
bottom of page