Shannon's channel coding theorem
GPTKB entity
Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Shannon's_noisy-channel_coding_theorem
|
| gptkbp:appliesTo |
discrete memoryless channels
noisy communication channels |
| gptkbp:basisFor |
modern digital communications
|
| gptkbp:doesNotSpecify |
explicit construction of codes
|
| gptkbp:field |
gptkb:information_theory
|
| gptkbp:formedBy |
gptkb:Claude_Shannon
|
| https://www.w3.org/2000/01/rdf-schema#label |
Shannon's channel coding theorem
|
| gptkbp:implies |
Channel capacity is the maximum rate of reliable communication.
|
| gptkbp:influenced |
coding theory
data compression telecommunications |
| gptkbp:provenBy |
Reliable communication is possible below channel capacity.
|
| gptkbp:publishedIn |
gptkb:A_Mathematical_Theory_of_Communication
|
| gptkbp:relatedConcept |
gptkb:Shannon_limit
gptkb:information_theory channel capacity error-correcting codes |
| gptkbp:state |
For any noisy channel, there exists a coding scheme that allows the transmission of information at any rate below channel capacity with arbitrarily small error probability.
|
| gptkbp:uses |
probabilistic arguments
|
| gptkbp:yearProposed |
1948
|
| gptkbp:bfsParent |
gptkb:noisy-channel_coding_theorem
gptkb:noisy_channel_coding_theorem |
| gptkbp:bfsLayer |
5
|