Introduction to Information Transmission and Processing - tutorials
This page is dedicated to the tutorial sessions of Introduction to Information Transmission and Processing (NTIN100) with the lectures given by Michal Koucký.
The tutorials take place on Monday at 10:40 in S10. The tutorials shall take place every second week, but we might be slightly flexible with this. (I will try to adhere to the schedule in SIS, but in case some irregularities occur, some slight rescheduling might happen. I will always try to inform you about this as soon as possible.)
If you have any questions, or you would like to consult something, send me an email to chmel(a half of an AT-AT)iuuk.mff.cuni.cz.
Attendance at the tutorials is voluntary but recommended. We will talk about previous homework solutions, questions regarding the topics from the lecture, and, if time permits (and it usually does), we will solve exercises for better understanding of the discussed topics.
Credit requirements
To get the class credit, you have to earn at least 66 % of the points for solving homework exercises.
There will be 4 series of homework, each worth approximately the same amount of points. All assignments are handed in solely through the Postal Owl. You should have received the enrollment token by now. If not, please send me a message.
I personally believe that discussing the homework together with your classmates is great, so I would like to encourage you to talk about the assignments. However, your submissions should be solely your own and written by yourselves only. This includes using Large Language Models: it is fine if you discuss the solutions, but you should not use it to generate solutions that you simply copy and paste. As such, I reserve the right to meet anyone either at Malá Strana or in the cyberspace and chat about their solution to make sure that you understand it (or to make sure that I understand the presented ideas correctly). I will try to do so in a reasonably short time, ideally within a week after the submission, so that you don't have to worry about forgetting the ideas.
Estimated schedule and history
| Date | Contents |
|---|---|
| 23. 2. 2026 | Probability review. Exercises. Exercise solutions. We have discussed the class credit rules and then we solved some problems. In particular, we have talked about different probabilistic techniques and theorems we might want to use. We have gone through all exercises 1-7. |
| 9. 3. 2026 | Entropy and KL-divergence. Exercises. Exercise solutions. |
| 23. 3. 2026 | Coding and compression. Exercises. Exercise solutions. |
| 6. 4. 2026 | Easter Monday -- there was no tutorial. |
| 20. 4. 2026 | Error correcting codes. Exercises. Exercise solutions. |
| 4. 5. 2026 | Plan: Linear codes. Exercises. |
| 18. 5. 2026 | Plan: Communication complexity. |