Noisy-channel coding theorem


Topic history | v1 (current) | created by janarez

Details

Noisy-channel coding theorem

| created by janarez | Add topic "Huffman coding"
Title
Noisy-channel coding theorem
Description
In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise contamination of a communication channel, it is possible to communicate discrete data (digital information) nearly error-free up to a computable maximum rate through the channel. This result was presented by Claude Shannon in 1948 and was based in part on earlier work and ideas of Harry Nyquist and Ralph Hartley. This founded the modern discipline of information theory.
Link
https://en.wikipedia.org/?curid=3474289

resources

treated in Shannon’s Noisy Coding Theorem
v1 | attached by janarez | Add topic "Huffman coding"

authors

This topic has no history of related authors.

topics

subtopic of Data compression
v1 | attached by janarez | Add topic "Huffman coding"