Elements of information theory
Elements of information theory
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information-theoretic analysis of information hiding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the achievable throughput of a multiantenna Gaussian broadcast channel
IEEE Transactions on Information Theory
Channel capacity and state estimation for state-dependent Gaussian channels
IEEE Transactions on Information Theory
Achievable rates in cognitive radio channels
IEEE Transactions on Information Theory
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
IEEE Transactions on Information Theory
Source Coding With Limited-Look-Ahead Side Information at the Decoder
IEEE Transactions on Information Theory
Information Rates Subject to State Masking
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
This work studies problems of source and joint source-channel coding under the requirement that the encoder can produce an exact copy of the compressed source constructed by the decoder. This requirement, termed here as the common reconstruction constraint (CR), is satisfied automatically in rate-distortion theory for single sources. However, in the common formulation of problems of lossy source coding with side information at the decoder (the Wyner-Ziv problem), distributed source coding, and joint source-channel coding for networks, the destination can exploit the information it receives in a manner that cannot be exactly reproduced at the sender side. Some applications, like the transmission of sensitive medical information, may require that both sides--the sender and the receiver--will share a common version of the compressed data, for the purpose of future discussions or consulting. The purpose of this work is to study the implications of CR constraints on the achievable rates in scenarios of lossy source coding and lossy transmission of sources. Three problems are examined: source coding with side information at the decoder, simultaneous transmission of data and state over state-dependent channels, and joint source-channel coding for the degraded broadcast channel. Single-letter characterizations of the optimal performance are developed for these problems, under corresponding CR constraints. Implications of this constraint on problems of joint source-channel coding in networks are discussed.