Ostatnia aktualizacja:
September 25. 2017 20:32:33
Aktualności / News > Dydaktyka / Teaching > Historia / History > Data Compression, winter 10/11

Data Compression, winter 10/11


Lecture is given by Prof. Irmina Herburt.

Results

Project is written in pairs.

In this year we focus on text compression.

Basic codes:
1. Huffman code
2. block prefix code
3. finite memory code
4. finite state code
5. arithmetic code
6. Lempel - Ziv code

The task is to implement some modification of the given algorithm, which could be particularily efficient for the benchmark text.
Additionally, test your algorithm on different texts and random sequence of characters.

Deadlines:
20.10.2010 Groups and topics
03.11.2010 Functional Documentation
15.12.2010 Application
05.01.2010 Final Presentation

Marks:
25% Functional Documentation
40% Application
35% Final Presentation

Late submissions: -10% of total grade for every started week after the deadline



The task is to implement some modification of the given algorithm, which could be particularily efficient for the benchmark text.

- http://download.wikimedia.org/enwiki/latest/enwiki-latest-stub-articles6.xml.gz
- test on random text string