Lectures Research Publications Vitae Contact

Multimedia Technology University of Lübeck ISNM 2003 Overview October 8 October 15 October 22 October 29 November 12 November 26 December 3 December 17 January 14 January 21 January 28 February 4 February 11 February 25 Seminar Group Work Home Assignments Reading Material Examination November 26th: Information Theory Content Coding, Decoding, prefix codes, minimal codes, Shannon's communication theory, information content, entropy, redundancy, relevancy, irrelevancy, lossless versus lossy coding, coding tradeoffs, Shannon-Fano Coding, Huffman Coding, Arithmetic Coding. Slides Slides 256-297  03_11_26_InformationTheory.pdf.zip (727,028 Bytes) Links  History of Information Theory (Lucent)  Data compression resource (datacompression.info)  Late Homepage of David A. Huffman  Everything about Huffman Coding  Everything about Arithmetic Coding References • David A. Huffman A Method for the Construction of Minimum-Redundancy Codes, Proceedings of the I.R.E., September 1952, 1098-1101.  PDF Download • Ian H. Witten, Radford M. Neal, John G. Cleary Arithmetic Coding for Data Compression, Communications of the ACM, June 1987, vol. 30, no. 6, pp. 520-540.  PDF Download • Alistair Moffat, Radford M. Neal, Ian H. Witten Arithmetic Coding Revisited, ACM Transactions on Information Systems, Vol. 16, No. 3, July 1998, pp. 256-294.  PDF Download • Claude E. Shannon, Warren Weaver The Mathematical Theory of Communication University of Illinois Press, Urbana and Chicago, 1949. Paperback reprint 1998. McLuhan ISNM 1157  Amazon

© 2003 Andreas Schrader & Martin Heike