Lecture 3: Entropy and Data Compression (II): Shannon's Source Coding Theorem and the Bent Coin Lottery

author: David MacKay, University of Cambridge
produced by: David MacKay (University of Cambridge)
author: David MacKay, University of Cambridge
published: Nov. 5, 2012,   recorded: March 2012,   views: 2489
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

See Also:

Download slides icon Download slides: mackay_course_03_01.pdf (13.9┬áMB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 addis zeray, October 9, 2013 at 11:56 a.m.:

study of reed Muller coding

Write your own review or comment:

make sure you have javascript enabled or clear this field: