Please confirm you email

Create An Account

Mov Huffman Coding and Proof of Its Optimality

Sumit Feb 9, 2014 By:

Reads: 119

Last modified: 03 May 2013

http://www.youtube.com/embed/-eJF0gs8OY0

Lecture -12 - Huffman Coding and Proof of Its Optimality of Information to Theory and Coding by Prof. S.N.Merchant, Department of Electrical Engineering, IIT Bombay. For more details on NPTEL visit http://nptel.iitm.ac.in

Course Detail

Information Theory and Coding - Definition of Information Measure and Entropy - Extension of An Information Source and Markov Source - Adjoint of An Information Source, Joint and Conditional Information Measures - Properties of Joint and Conditional Information Measures and a Markov Source - Asymptotic Properties of Entropy and Problem Solving in Entropy - Block Code and Its Properties - Instantaneous Code and Its Properties

Brainbuxa.com appreciates and recognises the work done by professors of IIT for delivering great lectures and enhancing Free Education worldwide through the initiative NPTEL. For more videos , do visit http://nptel.iitm.ac.in