On the source-channel separation theorem for infinite source alphabets

DOI10.1134/S0032946015020106MaRDI QIDQ259916zbMATH OpenFDO

Authors A. Aghajan, S. J. Zahabi, Mohammadali Khosravifard, T. Aaron Gulliver

Publication date 18 March 2016

Published in Problems of Information Transmission (Search for Journal in Brave)

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• The source-channel separation theorem revisited
• A separation theorem for single-source network coding
• The source coding theorem via Sanov's theorem (Corresp.)
• Rate distortion functions of countably infinite alphabet memoryless sources
• A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)

Cites work

• scientific article; zbMATH DE number 1821199 (Why is no real title available?)
• A Mathematical Theory of Communication
• Approximation theory of output statistics
• Elements of Information Theory
• General formulation of Shannon’s main theorem in information theory
• On the Interplay Between Conditional Entropy and Error Probability
• The source-channel separation theorem revisited

Cited in

(2)

• The source-channel separation theorem revisited
• On the method of types and approximation of output measures for channels with infinite alphabets

This page was built for publication: On the source-channel separation theorem for infinite source alphabets

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