Pries, Spring 2015, Information and Coding Theory: Tentative Syllabus
Week
1
2
3
4
5
6
7
8
Starts
1/21
1/26
2/2
2/6
2/16
2/23
3/2
3/9
9
10
11
12
13
14
15
3/23
3/30
4/6
4/13
4/20
4/27
5/4
Topics
Introduction to information theory and coding theory
Kraft and McMillan inequalities, ISBN codes
Huffman encoding, noiseless coding theorem
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)
spring break
Finite fields
Reed-Solomon codes
Cyclic and BCH codes
Concatenated codes, Low density parity check codes
Lattice Based Cryptography
Lattice Based Cryptography
Project Presentations
Important Dates:
Week 5, Midterm 1, Monday 2/16
Week 8, Midterm 2, Friday 3/27
Week 13, Midterm 3, Friday 5/01
Written Project due, Thursday 5/14, noon.
There is no final for this course.
Textbooks:
Steven Roman: Introduction to Coding and Information Theory