Pries, Spring 2014, Information and Coding Theory: Tentative Syllabus
Week
1
2
3
4
5
6
7
8
Starts
1/22
1/27
2/3
2/10
2/17
2/24
3/3
3/10
9
10
11
12
13
14
15
3/24
3/31
4/7
4/14
4/21
4/28
5/5
Topics
Introduction to information theory and coding theory
Group work: characteristics of codes
Kraft and McMillan inequalities, Huffman encoding, noiseless coding theorem
Monday Q1, Entropy
Hamming distance, nearest neighbor decoding, error-correcting capabilities
Vector spaces and lattices
Linear codes: generator and parity check matrices, Singleton bound
Bounds on codes (sphere-packing, Gilbert-Varshamov), Friday Q2,
spring break
Finite fields
Reed-Solomon, Cyclic and BCH codes
Concatenated codes, Low density parity check codes
Lattice Based Cryptography
Monday Q3, Group project
Project Presentations
Project Presentations
Q= quiz,
Important Dates:
Week 4, Quiz 1, Monday 2/10
Week 8, Quiz 2, Friday 3/14
Week 13, Quiz 3, Monday 4/21
Written Project due, Wednesday 5/14, noon.
There is no final for this course.
Textbooks:
Steven Roman: Introduction to Coding and Information Theory