noisy-channel coding theorem
GPTKB entity
Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Shannon's_channel_coding_theorem
|
| gptkbp:appliesTo |
discrete memoryless channels
|
| gptkbp:basisFor |
modern telecommunications
|
| gptkbp:defines |
channel capacity
|
| gptkbp:field |
gptkb:information_theory
|
| gptkbp:formedBy |
gptkb:Claude_Shannon
1948 |
| https://www.w3.org/2000/01/rdf-schema#label |
noisy-channel coding theorem
|
| gptkbp:implies |
Existence of error-correcting codes
|
| gptkbp:influenced |
coding theory
data compression digital communications |
| gptkbp:mathematicalFoundation |
gptkb:probability_theory
|
| gptkbp:publishedIn |
gptkb:A_Mathematical_Theory_of_Communication
|
| gptkbp:relatedTo |
gptkb:Shannon_entropy
channel coding mutual information error-correcting code |
| gptkbp:state |
Reliable communication is possible over a noisy channel at any rate below channel capacity
|
| gptkbp:bfsParent |
gptkb:information_theory
|
| gptkbp:bfsLayer |
4
|