A toy model for the proof of Shannon’s Noisy Coding Theorem for the BSC

Wildon's Weblog 2019-09-06

Summary:

In the Binary Symmetric Channel (BSC) with symbol error probability , an input bit flips with probability . A binary code of length can be used to communicate on the BSC by sending each bit of a codeword , collecting the received bits as a word still of length , and then decoding as the […]

Link:

https://wildonblog.wordpress.com/2019/09/06/a-toy-model-for-the-proof-of-shannons-noisy-coding-theorem/

From feeds:

Online Mathematical Communication » Wildon's Weblog

Tags:

channels theory teaching shannon coding

Authors:

mwildon

Date tagged:

09/06/2019, 16:42

Date published:

09/06/2019, 15:42