Sample converses in source coding theory

DOI10.1109/18.75241MaRDI QIDQ5753870zbMATH OpenOpenAlexFDO

Authors John C. Kieffer

Publication date 1991

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.75241

zbMATH Keywords

source codingsample conversessample performance of codes

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• Strong converses in source coding relative to a fidelity criterion
• The Empirical Distribution of Rate-Constrained Source Codes
• Variable-rate source coding theorems for stationary nonergodic sources
• A rate-distortion theorem for arbitrary discrete sources
• An application of rate-distortion theory to a converse to the coding theorem

Cited in

(4)

• Strong converses in source coding relative to a fidelity criterion
• Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields
• Algorithmic complexity of points in dynamical systems
• The Empirical Distribution of Rate-Constrained Source Codes

This page was built for publication: Sample converses in source coding theory

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