Lecture 7: Noisy Channel Coding (II): The Capacity of a Noisy Channel

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: 13687


Related Open Educational Resources

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.

See Also:

Download slides icon Download slides: mackay_course_07_01.pdf (34.4┬á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 Horea Kaii, October 30, 2020 at 5:16 p.m.:

Always impressive. Thanks for posting this!

Comment2 Leigh, October 30, 2020 at 5:19 p.m.:

I have been searching for this for so long.

Comment3 Lester, February 9, 2021 at 8:15 a.m.:

In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise contamination of a communication channel, it is possible to communicate discrete data (digital information) nearly error-free up to a computable maximum rate through the channel. https://wcitv.com/

Comment4 Lykka, May 22, 2021 at 9:29 a.m.:

Great lecture! Thank you for sharing.

Comment5 Marina, June 4, 2021 at 12:25 p.m.:

Wow, this is amazing. Thank you for sharing!

Comment6 Teresa, June 25, 2021 at 9:28 a.m.:

Thank you for sharing this lecture!

Comment7 M, June 29, 2021 at 9:06 a.m.:

Thanks for sharing this lecture! https://www.bestrestaurantloan.com/

Write your own review or comment:

make sure you have javascript enabled or clear this field: