In this paper, distributed (or multiterminal) source coding with one distortion criterion and correlated messages is considered. This problem can be also called “Berger-Yeung problem with correlated messages”. It corresponds to the source coding part of the graph-based framework for transmission of a pair of correlated sources over the multiple-access channel (MAC) where one is lossless and the...

In this paper, we derive the suboptimal sum-rate distortion bound for encoding correlated Gaussian sources for which the uniform scalar quantizers are used to convert the signals from analog to the discrete form. The correlated discrete signals are further compressed using the lossless Slepian and Wolf encoder. The gap between the suboptimal bound and the inner/outer bounds is also investigated...

The necessity of using and studying models that are similar to reality leads to the development of new network flows, generalizing the already known network structures. The multiterminal network flow is a natural development of the classical flow with one source and one sink and fixed upper limits of the flow function on each arc [1, 2]. There exists a number of engineering and economic problem...

In lossy source coding with side information at the decoder (i.e., the Wyner-Ziv problem), the estimate of the source obtained at the decoder cannot be generally reproduced at the encoder, due to its dependence on the side information. In some applications this may be undesirable, and a Common Reconstruction (CR) requirement, whereby one imposes that the encoder and decoder be able to agree on ...

Inspired by a recently proposed constructive framework for the distributed source coding problem, 1 we propose a powerful constructive approach to the watermarking problem, emphasizing the dual roles of "source codes" and "channel codes." In our framework, we explore various source and channel codes to achieve watermarks that are robust to attackers in terms of maximizing the distortion between...

Title of dissertation: INFORMATION THEORETIC GENERATION OF MULTIPLE SECRET KEYS Chunxuan Ye, Doctor of Philosophy, 2005 Dissertation directed by: Professor Prakash Narayan Department of Electrical and Computer Engineering and Institute for System Research This dissertation studies the problem of secret key generation for encrypted group communication in a network, based on an information theore...

This thesis deals with multiterminal source coding problems for a general framework of coding systems, called coding systems with cooperation, where there are some linkages among encoders and decoders. Especially, the main focus of this thesis is encoder cooperation. Two types of coding systems are investigated that incorporate encoder cooperation: the Slepian-Wolf coding system with linkages (...

Robust source coding provides both compression and noise mitigation without channel coding. In this paper , two methods of robust source coding are presented. The rst is DPCM incorporating a nonlinear lter; the second is Predictive Trellis-Coded Quantiza-tion (PTCQ), whose prediction lter is also nonlinear. Findings show that the incorporation of the nonlinear lter provides the ability to conce...

This paper introduces the reader to several information theoretic aspects of covert communications. In particular, it discusses fundamental limits on the amount of information that can be reliably communicated in such a way that a malevolent third-party observer cannot decode the messages. This situation is considered first for a system with a single intended receiver, and then extensions of se...