Related Concept Videos
Sampling Theorem
Thevinin's Theorem
Even and Odd Signals
Synthetic Disvision of Polynomials
Propagation of Uncertainty from Random Error
Encoding
Automatic processing involves the encoding of details like time, space, frequency, and the meaning of words, usually done without conscious...
You might also read
Related Articles
Articles linked to this work by shared authors, journal, and citation graph.
Biometric Identification Systems with Noisy Enrollment for Gaussian Sources and Channels.
Information Theoretic Security for Shannon Cipher System under Side-Channel Attacks <sup>†</sup>.
A Direct Link between Rényi-Tsallis Entropy and Hölder's Inequality-Yet Another Proof of Rényi-Tsallis Entropy Maximization.
Related Experiment Video
Updated: Nov 27, 2025

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans
Published on: August 16, 2017
Exponential Strong Converse for Source Coding with Side Information at the Decoder.
1Department of Communication Engineering and Informatics, University of Electro-Communications, Tokyo 182-8585, Japan.
This study analyzes data compression error probabilities outside the Wyner-Ziv rate distortion region. We show these error probabilities decrease exponentially, establishing a strong converse coding theorem for Wyner-Ziv source coding.
Area of Science:
- Information Theory
- Data Compression
- Coding Theory
Background:
- The Wyner-Ziv problem addresses data compression with side information available at the decoder.
- The rate-distortion region defines achievable trade-offs between compression rate (R) and distortion level (Δ).
Purpose of the Study:
- To investigate the error probability of decoding for (R, Δ) pairs outside the established Wyner-Ziv rate-distortion region.
- To analyze the performance of Wyner-Ziv source coding when operating beyond theoretical limits.
Main Methods:
- Mathematical analysis of decoding error probabilities.
- Derivation of exponential bounds on error probability.
- Proof of the strong converse coding theorem as a corollary.
Main Results:
- Demonstrated that decoding error probability approaches zero exponentially for (R, Δ) outside the rate-distortion region.
- Derived an explicit lower bound for the exponent of this probability.
- Established the strong converse coding theorem for the Wyner-Ziv problem.
Conclusions:
- The Wyner-Ziv source coding problem exhibits a strong converse property.
- Performance degrades gracefully but predictably when operating outside the optimal rate-distortion region.
