The strong converse for source coding with a fidelity criterion

MaRDI QIDQ1389266zbMATH OpenFDO

Authors Te Sun Han, H. Oishi

Publication date 8 July 1998

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

zbMATH Keywords

source codingfidelity criterion

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Strong converses in source coding relative to a fidelity criterion
• Strong universal source coding subject to a rate-distortion constraint
• The redundancy of source coding with a fidelity criterion. 1. Known statistics
• scientific article; zbMATH DE number 1264373

Cited in

(8)

• Strong converses in source coding relative to a fidelity criterion
• Error exponent for source coding with a fidelity criterion
• On coding of underdetermined sequences with a fidelity criterion
• Robust source coding of weakly compact classes
• Strong universal source coding subject to a rate-distortion constraint
• Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff
• Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems
• The reliability functions of the general source with fixed-length coding

This page was built for publication: The strong converse for source coding with a fidelity criterion

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