Strong converses in source coding relative to a fidelity criterion

DOI10.1109/18.75240MaRDI QIDQ5753869zbMATH 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.75240

zbMATH Keywords

source codingstrong converses

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• The strong converse for source coding with a fidelity criterion
• scientific article; zbMATH DE number 1264373
• Sample converses in source coding theory
• Block-definition approaches to source coding with a fidelity criterion
• An application of rate-distortion theory to a converse to the coding theorem

Cited in

(8)

• The strong converse for source coding with a fidelity criterion
• Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff
• Robust source coding of weakly compact classes
• Convergence of distortion for block coding of symmetric modular sources (Corresp.)
• scientific article; zbMATH DE number 1264373 (Why is no real title available?)
• Block source coding theory for asymptotically mean stationary sources
• Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems
• Sample converses in source coding theory

This page was built for publication: Strong converses in source coding relative to a fidelity criterion

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