CSE 545, Error Correcting Codes: Combinatorics, Algorithms and Applications

Lectures

  • Lecture 1: Introduction (Slides: ppt ). [Book: Pg. 1]
  • Lecture 2: Definitions. [Book: Sec 1.1, 1.2] ( Proof Reader: Isaac Elbaz)
  • Lecture 3: More on Parity and Repetition Codes. [Book: Sec 1.3]. (Proof reader: Jimmy Dobler)
  • Lecture 4: Distance of a Code. [Book: Sec 1.4]. (Proof reader: Robert Stewart)
  • Lecture 5: Hamming Code. [Book: Sec 1.5]. (Proof reader: Namita Vishnubhotla)
  • Lecture 6: Hamming Bound. [Book: Sec 1.6, 1.7] (Proof reader: Aditya Kapre)
  • Lecture 7: Linear Codes. [Book: Sec 2.1, 2.2] (Proof reader: Isaac Elbaz)
  • Lecture 8: More on linear Codes. [Book: Sec 2.2, 2.3] (Proof reader: Jimmy Dobler) [Guest lecture by Jesse Hartloff]
  • Lecture 9: General Hamming codes. [Book: Sec 2.3 and 2.4]. (Proof reader: Robert Stewart)
  • Lecture 10: Dual of linear Codes. [Book: Sec 2.5, 2.6 and 2.7]. (Proof reader: Namita Vishnubhotla)
  • Lecture 11: Hamming Code. [Book: Sec 2.7, Sec 3.3]. (Proof Reader: Aditya Kapre)
  • Reading Assignment: Probability Basics [Book: Sec 3.1, 3.2]. (Proof Reader: Mahmoud Abo Khamis)
  • Lecture 12: Gilbert-Varshamov Bound. [Book: Sec 3.3,4.1, 4.2]. (Proof Reader: Isaac Elbaz)
  • Lecture 13: Varshamov Construction. [Book: Sec 4.2]. (Proof Reader: Jimmy Dobler)
  • Lecture 14: Singleton Bound. [Book: 4.2, 4.3]. (Proof Reader: Robert Stewart)
  • Lecture 15: Plotkin Bound. [Book: Sec 4.4]. (Proof Reader: Aditya Kapre)
  • Lecture 16: Polynomials over Finite fields. [Book: Sec 4.4, 5.1] (Proof Reader: Namita Vishnubhotla)
  • Lecture 17: Reed-Solomon Codes. [Book: Sec 5.1, 5.2]. (Proof Reader: Mahmoud Abo Khamis)
  • Lecture 18: Properties of Reed-Solomon Codes. [Book: Sec 5.2]. (Proof Reader: Isaac Elbaz)
  • Lecture 19: Fuzzy Vault [Book: Sec 15.1, 15.2]. (Proof Reader: Jimmy Dobler)
  • Lecture 20: Juels-Sudan Fuzzy vault [Book: Sec 15.2, 15.3]. (Proof Reader: Robert Stewart)
  • Lecture 21: Shannon's Theorem. [Book: Sec 6.1, 6.2]. (Proof Reader: Aditya Kapre)
  • Lecture 22: Converse of Shannon's Theorem. [Book: Sec 6.3]. (Proof Reader: Namita Vishnubhotla)
  • Lecture 23: Proof of Shannon's Theorem. [Book: Sec 6.3]. (Proof Reader: Mahmoud Abo Khamis)
  • Lecture 24: Shannon vs. Hamming. [Book: Sec 6.3, 6.4, 7.1, 7.2]. (Proof Reader: Isaac Elbaz)
  • Lecture 25: List Decoding [Book: Sec 7.1-7.3]. (Proof Reader: Jimmy)
  • Lecture 26: Johnson Bound. [Book: Sec 7.3] (Proof Reader: Robert)
  • Lecture 27: List Decoding Capacity [Book: 7.4]. (Proof Reader: Aditya)
  • Lecture 28: Elias-Bassalygo Bound. [Book: Chap 8, Sec 9.1] (Proof Reader: Namita)
  • Lecture 29: Code Concatenation [Book: Sec 9.1, 9.2]. (Proof Reader: Mahmoud)
  • Lecture 30: Justesen Codes [Book: Sec 9.3]. (Proof Reader: Jimmy)
  • Lecture 31: Expander Graphs [Book: Sec 10.1, 10.2]. (Proof Reader: Isaac)
  • Lecture 32: Expander Codes [Book: Sec 10.3]. (Proof Reader: Robert)
  • Lecture 33: Decoding Concatenated Codes [Book: Sec 11.1, 11.2]. (Proof Reader: Aditya)
  • Lecture 34: Generalized Minimum Distance Decoding [Book: 11.2, 11.3]. (Proof Reader: Namita)
  • Lecture 35: Generalized Minimum Distance Decoding-II [Book: 11.3, 12.1]. (Proof Reader: Mahmoud)
  • Lecture 36: Achieving BSC Capacity [Book: Chap 12]. (Proof Reader: Isaac)
  • Lecture 37: Welch-Berlekamp Algorithm [Book: Sec 13.1]. (Proof Reader: Jimmy)
  • Lecture 38: List Decoding RS Codes [Book: Sec 13.2.1, 13.2.2]. (Proof Readers: Robert)
  • Lecture 39: List Decoding RS Codes-II [Book: Sec 13.2.3, 13.2.4]. (Proof Readers: Aditya)
  • Lecture 40: List Decoding Folded RS Codes [Book: Sec 14.1, 14.2]. (Proof Readers: Namita)
  • Lecture 41: List Decoding Folded RS Codes-II [Book: Sec 14.3]. (Proof Readers: Mahmoud)
  • Lecture 42: Wrap-up [Book: Sec 14.3].

    Acknowledgment

    The material in this webpage is supported in part by the National Science Foundation under CAREER grant CCF-0844796. Any opinions, findings and conclusions or recomendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF).