|
|
|
||
|
The course covers the fundamental concepts of information theory, error-correcting codes and communication complexity.
Last update: IUUK (27.04.2015)
|
|
||
|
The credit from tutorials is given based on the number of points obtained from the homework assignments. To get the credit one has to get at least 70% of the total number of points from the assignments.
There are no make-up homeworks.
The exam is oral. Last update: Koucký Michal, prof. Mgr., Ph.D. (10.06.2019)
|
|
||
|
· T.M. Cover, J.A. Thomas, Elements of Information Theory. John Wiley & Sons, 2nd edition, 2006. · F.J. MacWilliams, N.J.A. Sloane, The theory of error correcting codes. North-Holland, Amsterdam, 1981. · E. Kushilevitz, N. Nisan, Communication Complexity. Cambridge University Press, 1997. · J.H. van Lint, Introduction to coding theory. Springer, 3rd edition, 1998. Last update: IUUK (27.01.2015)
|
|
||
|
The exam is oral from the material covered by the lectures. Each student gets reasonable time (at most three hours) for preparation upon receiving the questions.
Study materials (lecture notes, text books, etc.), computers and other electronic devices are not allowed during the exam. Last update: Koucký Michal, prof. Mgr., Ph.D. (10.06.2019)
|
|
||
|
Information Theory · Information, entropy, mutual information · Relative information and its properties · Data compression - Shannon-Fano code, Huffman code · Kolmogorov complexity, Kolmogorov information, symmetry of Kolmogorov information
Error-Correcting Codes · Data transmission over a noisy channel, channel capacity, Shannon's theorems · Non-explicit codes · Hamming codes · Reed-Solomon codes, Berlekamp-Welch algorithm
Communication Complexity · Model of communication complexity · Deterministic complexity, combinatorial rectangles, examples · Probabilistic protocols, public and private random bits · Non-deterministic protocols · Application: analysis of data structures
Last update: IUUK (27.04.2015)
|