Data Compression Techniques
Koe
Vuosi | Lukukausi | Päivämäärä | Periodi | Kieli | Vastuuhenkilö |
---|---|---|---|---|---|
2015 | kevät | 13.01-26.02. | 3-3 | Englanti | Simon Puglisi |
Luennot
Aika | Huone | Luennoija | Päivämäärä |
---|---|---|---|
Ti 14-16 | B222 | Simon Puglisi | 13.01.2015-26.02.2015 |
To 14-16 | B222 | Simon Puglisi | 13.01.2015-26.02.2015 |
Harjoitusryhmät
Aika | Huone | Ohjaaja | Päivämäärä | Huomioitavaa |
---|---|---|---|---|
Ke 10-12 | B222 | Anna Kuosmanen | 19.01.2015—27.02.2015 |
Kirjallisuus ja materiaali
Topics for exam:
From Simon:
- Integer codes: Elias gamma, Vbyte, Simple9 (word-aligned), interpolative
- LZ77
- RLZ
- level-order representation of binary trees
From Travis:
- the definition of entropy
- the statement (but not the proof) of Shannon's Noiseless Coding Theorem
- the statement (and some idea of the proof) of the Kraft Inequality
- Huffman's Algorithm (and some idea of the proof of correctness)
- how to make a prefix-free code canonical
- move-to-front (but not the analysis)
- arithmetic coding (but not the analysis)
- how to compute and invert the BWT (and have some idea of how it works)
- wavelet trees (but not the space analysis)
- FM-indexes (backward stepping, counting)
- bounds for RMQs
From both:
- applying rank and select on bitvectors (but without having to know all the details of the succinct/compressed solutions)
FINAL NOTE: Please give feedback for the course. You may use anonymous feedback form or give direct feedback.
ATTENTION!!!: The project course (Project in Data Compression Techniques) has it's first meeting on Friday, 13.03.2015. Hope to see you there. The meeting will give an overview of what is expected.