Course description: This is an introductory course on error correction codes, and we will mostly take an algebraic viewpoint here. Topics we will cover : general notion of error correcting codes, minimum distance, and rate, error detection / correction capability, basic treatment of algebraic structures like groups / finite fields, linear block codes and their general properties, bounds on code parameters such as rate and minimum distance, popular example constructions such as Hamming, Reed Muller, and Reed Solomon codes, concatenated codes, list decoding, expander codes.
Resources:
Communication will be mainly through Moodle.