| Week |
Monday |
Wednesday |
Friday |
35
|
----------- |
Introduction and course goals,
first encounter with information theory |
Basic elements of coding theory,
the binary field, basic parameters of codes etc. |
36
|
simple block codes, weight distribution, error bounds |
convolutional codes, basic treatment, weight distribution, error bounds |
Characterization of codes
|
37
|
Some results from information theory |
random-like codes and their qualitative performance |
Geometry of Hamming space
|
38
|
Constructing codes by combining smaller codes, product codes, concatenated
codes, generalized concatenated codes, multilevel codes |
Constructing codes by combining smaller codes, product codes, concatenated
codes, generalized concatenated codes, multilevel codes, multilevel decoding |
Multilevel Decoding, GMD
|
39
|
Graphical models in Coding, MRF, Bayesian Nets, Factor graphs |
Graphical models in Coding, MRF, Bayesian Nets, Factor graphs |
|
40
|
Algorithms in graphical models
Sum product, min sum |
Algorithms in graphical models
Viterbi, Forward-Backward, SOVA |
|
41
|
Definition of recursive convolutional codes and Turbo codes |
Permutation design for turbo codes |
|
42
|
Performance of Turbo codes, union bound arguments |
The Gaussian approximation |
|
43
|
LDPC codes, Gallager's approach |
Gallagers proof of convergence |
|
44
|
The method of Richardson-Urbanke-Shokrollahi
Density evolution |
The method of Richardson-Urbanke-Shokrollahi
Density evolution |
|
45
|
McEliece's
Repeat-Accumulate Codes |
McEliece's
Repeat-Accumulate Codes |
|
46
|
Tanner's approach to constructing codes on graphs |
Tanner's approach to constructing codes on graphs |
|
47
|
Integrative schemes, equalization, interference suppression, synchronization |
Integrative schemes, equalization, interference suppression, synchronization |
|
48
|
break
|
break |
break |
49
|
to be determined |
to be determined |
----------- |
50
|
to be determined
|
to be determined
|
|