Entropy and error-correcting codes
Kent Quanrud · 66:22
Shannon’s 1948 noisy-channel coding theorem says that on a binary symmetric channel (each bit flips independently with probability \(p\)), the optimal transmission rate is exactly \(1-H(p)\): you can get arbitrarily c...