Content deleted Content added
→Examples: replace citation to aggregator with citation to original publication, remove one redundant citation to existing source (the citation also copied too much from the source) |
→Communication channel capacity: fix dead url and improve citation |
||
Line 24:
=== Communication channel capacity ===
[[Claude Shannon]] showed a simple but impractical [[code]] that could reach the capacity of a [[communication channel]]. It requires assigning a random code word to every possible <math>n</math>-bit message, then decoding by finding the closest code word. If <math>n</math> is chosen large enough, this beats any existing code and can get arbitrarily close to the capacity of the channel. Unfortunately, any <math>n</math> big enough to beat existing codes is also completely impractical.<ref>{{cite web |url=https://news.mit.edu/2010/explained-shannon-0115 |title=Explained: The Shannon limit |publisher=MIT News Office |author=Larry Hardesty |date=January 19, 2010}}</ref> These codes, though never used, inspired decades of research into more practical algorithms that today can achieve rates arbitrarily close to channel capacity.<ref>{{cite web |url=https://ocw.mit.edu/courses
=== Sub-graphs ===
| |||