MATH 516 Coding and Information Theory
Uniquely Decodable Codes, Instantaneous codes and their construction, Optimal Codes, Binary Huffman Codes, Average Word Length and Optimality of Binary Huffman codes, r-ary Huffman Codes, Information and Entropy, Average Word-Length, Shannon's First Theorem, Information Channels, Decision Rules, Hamming Distance, Comments on Shannon's Theorem, Error-Correcting Codes, Minimum Distance, Hadamard Matrices, Linear Codes.
Prerequisites: Math 221, Math 531 or permission of the instructor.