Alison's New App is now available on iOS and Android! Download Now
Reminders
Support
By the end of this module, you will be able to:
• Discuss the basic properties of variable–length codes
• Identify the relationship between prefix–free code and Kraft’s inequality
• Explain the basic properties of Shannon and Huffman codes
• Describe the notion of minmax redundancy
• Outline the concept of type–based universal compression
• Discuss the differences between entropic and universal compression
Log in to save your progress and obtain a certificate in Alison’s free Data Compression Methods in Information Theory online course
Sign up to save your progress and obtain a certificate in Alison’s free Data Compression Methods in Information Theory online course
Please enter you email address and we will mail you a link to reset your password.
