Math Club

An Introduction to Data Compression
Thursday, 9 November 2017 - 2:30 pm to 3:00 pm
Room number: 
Registration required: 
Cost to attend: 
Free of charge
Event language: 

November 9, Thursday, 14:30-16:00 KED B005

Speaker: Gilles Lamothe (uOttawa)

Abstract: Judiciously coding the symbols in a file can lead to compression without losing information. We will discuss Huffman's solution to the optimal prefix-free coding problem.

We will also discuss the relationship between Shannon's entropy and the optimal coding problem.