Data Compression Algorithms
| Code | Completion | Credits | Range |
|---|---|---|---|
| PI-AKD | ZK | 4 | 3C |
- Garant předmětu:
- Jan Holub
- Lecturer:
- Jan Holub
- Tutor:
- Jan Holub
- Supervisor:
- Department of Theoretical Computer Science
- Synopsis:
-
Goals:
After completing the course, the students will be able to design special data compression methods or their compositions customized for a given problem. The efficiency of designed solution is evaluated by many parametes not only by the compression ratio.
Added value:
The students will learn to evaluate advantages and disadvantages of data compression methods and their classes. They also learn to construct cascade methods in order to achieve desired properties of the resulting data compression system.
- Requirements:
- Syllabus of lectures:
- Syllabus of tutorials:
- Study Objective:
-
After completing the course, the students will be able to design special data compression methods or their compositions customized for a given problem. The efficiency of designed solution is evaluated by many parametes not only by the compression ratio.
- Study materials:
-
Salomon, D.: Data Compression. Springer, 2004.
Moffat, A., Turpin, A.: Compression and Coding Algorithms. Kluwer Academic Publishers, 2002.
- Note:
- Time-table for winter semester 2023/2024:
- Time-table is not available yet
- Time-table for summer semester 2023/2024:
- Time-table is not available yet
- The course is a part of the following study plans:
-
- Informatics (doctoral) (compulsory elective course)
- Informatics (compulsory elective course)