Course on Information Theory, Pattern Recognition, and Neural Networks

Lecture 8: Noisy Channel Coding (III): The Noisy-Channel Coding Theorem

author: David MacKay, University of Cambridge
produced by: David MacKay (University of Cambridge)
author: David MacKay, University of Cambridge
published: Nov. 5, 2012, recorded: May 2012, views: 14288

Slides

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.

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:

1 Ethan, November 11, 2015 at 11:39 p.m.:

I'm having a problem with the very end of the proof. P2 vanishes if M>>NH2(f); doesn't this mean that R<<C? If the rate has to be much less than the capacity, then how have we proved the theorem, which allows us to construct codes with rates arbitrarily close to C with vanishingly small error?

2 ergodic, November 27, 2016 at 1:14 a.m.:

To Ethan: the rate is K/N = 1 - M/N. In order to make the error as small as desired we would increase M. But we are also free to increase N (increase the number of times the channel is used) to keep the rate away from zero -- but we won't be able to exceed C.

Write your own review or comment:

Comment:
Name:
Email address:
URL:

make sure you have javascript enabled or clear this field: