en
0.25
0.5
0.75
1.25
1.5
1.75
2
Lecture 3: Entropy and Data Compression (II): Shannon's Source Coding Theorem and the Bent Coin Lottery
Published on Nov 05, 201222373 Views
Related categories
Chapter list
Outline00:00
How To Compress A Redundant File?00:55
How To Measure Information Content?01:21
Testing 'Shannon Information Content' Claims (1)01:48
How To Measure Information Content?02:58
The Bent Coin Lottery03:15
Testing 'Shannon Information Content' Claims (2)03:59
Sixty-Three (1)04:12
Sixty-Three (2)04:46
Sixty-Three (3)05:06
Sixty-Three (4)07:03
Sixty-Three (5)07:27
Sixty-Three (6)08:09
Sixty-Three (7)08:42
Sixty-Three (8)09:24
Sixty-Three (9)10:54
Sixty-Three (10)11:11
Sixty-Three (11)11:58
Sixty-Three (12)12:18
Submarine (1)13:25
Submarine (2)13:51
Submarine (3)14:43
Submarine (4)15:54
Submarine (5)16:10
Submarine (6)16:47
Submarine (7)17:03
Submarine (8)17:43
Submarine (9)18:54
Submarine (10)19:09
Submarine (11)19:55
The Bent Coin Lottery (1)21:09
The Bent Coin Lottery (2)22:25
The Bent Coin Lottery (3)22:43
The Bent Coin Lottery (4)23:29
The Bent Coin Lottery (5)24:31
The Bent Coin Lottery (6)30:00
The Bent Coin Lottery (7)30:49
The Bent Coin Lottery (8)31:49
The Binomial Distribution (9)33:19
The Bent Coin Lottery (10)34:20
The Bent Coin Lottery (11)36:01
The Bent Coin Lottery (12)36:17
The Bent Coin Lottery (13)37:42
The Bent Coin Lottery (14)38:41
The Bent Coin Lottery (15)41:08
The Bent Coin Lottery (16)41:55
The Bent Coin Lottery (17)42:17
The Bent Coin Lottery (18)43:53
The Bent Coin Lottery (19)44:27
The Bent Coin Lottery (20)45:27
The Bent Coin Lottery (21)46:19
Source Coding Theorem 48:42
How To Compress a Redundant File - Practically?49:39
Recommended Exercises50:10