Coding theorems of information theory

MaRDI QIDQ3285917zbMATH OpenFDO

Authors Jacob Wolfowitz

Publication date 1961

zbMATH Keywords

coding theoremsinformation theoryprobability theory

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24)

Cited in

(17)

• Multiple-user communication
• Limited role of entropy in information economics
• The separating property of random matrices
• A conversation with Samuel Kotz
• Über Kanäle vom Dichtetypus
• Strong converse theorems using Rényi entropies
• Intrinsic Markov Chains
• Simple proofs for the strong converse theorems in some channels
• Meßfehler und Information
• Coding theorems for the compound semi-continuous memoryless channels
• Verschlüsselungstheorie für symmetrische Kanäle
• Beitr�ge zur Shannonschen Informationstheorie im Falle nichtstation�rer Kan�le
• The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
• The strong converse theorem in the decoding scheme of list size L
• Information in Probability: Another Information-Theoretic Proof of a Finite de Finetti Theorem
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
• Second-order converses via reverse hypercontractivity

This page was built for publication: Coding theorems of information theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3285917)