en
0.25
0.5
0.75
1.25
1.5
1.75
2
Lecture 8: Noisy Channel Coding (III): The Noisy-Channel Coding Theorem
Published on Nov 05, 201214417 Views
Related categories
Chapter list
The Proof Of The Noisy-Channel Coding Theorem00:00
Introduction00:06
Definition Of Capacity00:35
Noisy Typewriter (1)01:45
Capacity (1)03:05
Noisy Typewriter (2)04:07
Capacity (2)04:57
The Non-Confusable Subset Of Inputs (1)06:12
Capacity (3)07:06
Extended Channel08:40
The Non-Confusable Subset Of Inputs (2)10:43
The Non-Confusable Subset Of Inputs (2)12:00
The Non-Confusable Subset Of Inputs (3)12:55
Shannon's Noisy Channel Coding Theorem (1)15:51
Shannon's Noisy Channel Coding Theorem (2)16:21
Shannon's Noisy Channel Coding Theorem (3)18:47
Shannon's Noisy Channel Coding Theorem (4)20:13
(7,4) Hamming Code (1)20:43
(7,4) Hamming Code (3)22:10
(7,4) Hamming Code (4)23:18
(7,4) Hamming Code (2)23:27
(7,4) Hamming Code (5)24:17
(7,4) Hamming Code (6)25:22
(7,4) Hamming Code (7)26:12
How We Won The Bent Coin Lottery (1)27:51
How We Won The Bent Coin Lottery (2)28:35
How To Prove Good Codes Exist (1)29:02
Shannon's Way Of Proving Malnutrition30:19
Capacity(4)32:13
Proof For The Binary Symmetric Channel32:39
How We Won The Bent Coin Lottery (3)33:28
(7,4) Hamming Code (8)35:16
The Probability Of Error (1)37:09
The Probability Of Error (2)40:26
The Probability Of Error (3)41:21
The Probability Of Error (4)45:23
The Probability Of Error (5)47:52
The Probability That Hx=0 mod 2 (1)50:33
The Probability That Hx=0 mod 2 (3)54:26
The Probability That Hx=0 mod 2 (2)54:49
Capacity (5)58:20
Capacity (6)01:00:06
Homework01:08:45