Shannon's noisy-channel coding theorem
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Shannon's_channel_coding_theorem
|
| gptkbp:appliesTo |
discrete memoryless channels
noisy communication channels |
| gptkbp:basisFor |
modern telecommunications
|
| gptkbp:compatibleWith |
explicit code constructions
|
| gptkbp:defines |
channel capacity
|
| gptkbp:field |
gptkb:information_theory
|
| gptkbp:form |
gptkb:organization
gptkb:probability_theory mutual information |
| gptkbp:formedBy |
gptkb:Claude_Shannon
|
| https://www.w3.org/2000/01/rdf-schema#label |
Shannon's noisy-channel coding theorem
|
| gptkbp:implies |
existence of error-correcting codes
|
| gptkbp:influenced |
coding theory
data compression digital communications |
| gptkbp:provenBy |
achievability of channel capacity
|
| gptkbp:publishedIn |
gptkb:A_Mathematical_Theory_of_Communication
|
| gptkbp:state |
for any noisy channel, reliable communication is possible at any rate below channel capacity
|
| gptkbp:yearProposed |
1948
|
| gptkbp:bfsParent |
gptkb:Shannon's_channel_coding_theorem
|
| gptkbp:bfsLayer |
6
|