Noisy-channel coding theorem

GPTKB entity

Predicate	Object
gptkbp:instanceOf	gptkb:mathematical_concept
gptkbp:alsoKnownAs	gptkb:Shannon's_channel_coding_theorem
gptkbp:appliesTo	continuous channels discrete memoryless channels
gptkbp:basisFor	development of practical coding schemes
gptkbp:category	gptkb:information_theory gptkb:mathematical_concept
gptkbp:doesNotSpecify	explicit construction of codes
gptkbp:field	gptkb:information_theory
gptkbp:form	For any ε>0 and rate R < C, there exists a code with arbitrarily small error probability
gptkbp:formedBy	gptkb:Claude_Shannon
https://www.w3.org/2000/01/rdf-schema#label	Noisy-channel coding theorem
gptkbp:implies	Existence of error-correcting codes
gptkbp:influenced	modern digital communication
gptkbp:provenBy	random coding argument
gptkbp:publishedIn	gptkb:A_Mathematical_Theory_of_Communication
gptkbp:relatedTo	gptkb:Shannon_limit channel capacity coding theory error-correcting codes
gptkbp:state	Reliable communication is possible over a noisy channel at any rate below channel capacity
gptkbp:yearProposed	1948
gptkbp:bfsParent	gptkb:Information_Theory
gptkbp:bfsLayer	5