Lectures

Following is an outline of lectures given along with references and links to additional reading. For the abbreviations (ECT), (Hill), (Roth), (Lint), please check the references page.

Lec 1 (30 Jul, Thu) : Course plan. Basic goals in the design of error correcting codes. Shannon’s model of communication. Examples of simple codes - repetition codes, parity check codes. On error detection and correction of codes.

^{Reading : (ECT) Section 1.1; (Hill) Chapter 1}

^{Person of the day : Claude E. Shannon - Father of information theory, AI agent of same first name, Mathematical Theory of Communication, Creative thinking.}

Lec 2 (01 Aug, Sat) : (9.30 - 10.45 AM) Hamming code- description and codewords. Parity check criteria for error detection. Error correction in Hamming codes as guided exercise.

^{Reading : (ECT) Section 1.2 to 1.5}

^{Person of the day : Richard W. Hamming - Famous for Hamming codes, Hamming metric, Hamming ball and Hamming bound, ACM Turing award laudation ‘Purpose of computing is insight, not numbers’, You and your research.}

^{Exercises : (ECT) Chap 1, Problems 1.1, 1.3}

Lec 3 (01 Aug, Sat) : (11.00 - 12.30 PM) Hat check puzzle - two approaches using codes. Minimum distance and its role in error detection and unique decoding.

^{Reading : (ECT) Section 1.2}

^{Exercises : (ECT) Chap 1, Problems 1.5, 1.10, 1.11}

Lec 4 (04 Aug, Tue) : Code with distance $d \ge 2$ $\iff$, it can detect $d-1$ errors, correct $\lfloor (d-1)/2 \rfloor$ errors. Errors and erasures. BSC and BEC channel models.

^{Reading : (ECT) Chap Section 1.2, 1.3, 1.4, (Hill) Chap 2}

^{Person of the day : Robert Fano - Famous for Fano’s inequality, Developed one of the first timer-sharing computers. One of the world’s first open-source advocates.}

^{Exercises : (ECT) Chap 1, Problem 1.6, 1.8}

Lec 5 (06 Aug, Thu) : Linear binary codes. Review of basic linear algebra. Linear codes. Characterization using generator and parity check matrix. Computing minimum distance from parity check matrix.

^{Reading : (ECT) Chap 2, Section 2.2, 2.3, 2.4, (Hill) Chap 5}

^{Person of the day : Irving S. Reed - Famous for Reed Solomon codes, Design team of MADDIDA computer, Developed the register transfer language.}

^{Exercises : (Hill) Chap 5, Ex. 5.1, 5.3}

Lec () (11 Aug, Tue) : Instructor out of town (compensated on Aug 01)

Lec () (13 Aug, Thu) : Instructor out of town (compensated on Aug 01)

Lec () (18 Aug, Tue) : Instructor out of town (to be compensated)

Lec () (20 Aug, Thu) : Instructor out of town (to be compensated)

Lec 6 (25 Aug, Tue) :

^{Reading :}

Lec 7 (27 Aug, Thu) :

^{Reading :}

Lec 8 (01 Sep, Tue) :

^{Reading :}

Lec 9 (03 Sep, Thu) :

^{Reading :}

Lec 10 (08 Sep, Tue) :

^{Reading :}

Lec 11 (10 Sep, Thu) :

^{Reading :}

Lec 12 (15 Sep, Tue) :

^{Reading :}

Lec 13 (17 Sep, Thu) :

^{Reading :}

Lec 14 (22 Sep, Tue) :

^{Reading :}

Lec 15 (24 Sep, Thu) :

^{Reading :}

Lec 16 (29 Sep, Tue) :

^{Reading :}

Lec 17 (01 Oct, Thu) :

^{Reading :}

Lec 18 (06 Oct, Tue) :

^{Reading :}

Lec 19 (08 Oct, Thu) :

^{Reading :}

Lec 20 (13 Oct, Tue) :

^{Reading :}

Lec 21 (15 Oct, Thu) :

^{Reading :}

Lec () (20 Oct, Tue) : Holiday due to Dussehra

Lec 22 (22 Oct, Thu) :

^{Reading :}

Lec 23 (27 Oct, Tue) :

^{Reading :}

Lec 24 (29 Oct, Thu) :

^{Reading :}

Lec 25 (03 Nov, Tue) :

^{Reading :}

Lec 26 (05 Nov, Thu) :

^{Reading :}

Lec 27 (10 Nov, Tue) :

^{Reading :}

Lec 28 (12 Nov, Thu) :

^{Reading :}