Strong converses in source coding relative to a fidelity criterion

DOI10.1109/18.75240zbMATH Open0721.94003OpenAlexW2161696090MaRDI QIDQ5753869

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)

Related Items (2)

Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff ⋮ Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems

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)