Data Compression Techniques Lecture 6 Arithmetic Coding (2015) 计算机科学

Lecture 6: Arithmetic CodingLecturer: TravisJanuary 29th, 2015What I expect you to remember from January for the exam:• the definition of Entropy • the statement (not so much the proof) of Shannon’s NoiselessCoding Theorem• the statement (and maybe the proof?) of the Kraft Inequality • Huffman’s Algorithm (not so much the proof of correctness) • how to make a prefix-free code canonical • Move-to-Front (not so much the analysis) • Arithmetic Coding (not so much the analysis)Arithmetic coding can