On the Role of Encoder Side-Information in Source Coding for Multiple Decoders
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
The main goal in network information theory is to identify fundamental limits of communication over networks, and design solutions which perform close to such limits. After several decades of effort, many important problems still do not have a characteriza ...
We study the source coding problem in sensor networks deployed to monitor the evolution of spatio-temporal temperature distributions. The sensors sample the temperature field, quantize the samples and transmit the encoded samples through digital channels t ...
Institute of Electrical and Electronics Engineers2011
Polar coding is a recently invented technique for communication over binary-input memoryless channels. This technique allows one to transmit data at rates close to the symmetric-capacity of such channels with arbitrarily high reliability, using low-complex ...
Vision sensor networks and video cameras find widespread usage in several applications that rely on effective representation of scenes or analysis of 3D information. These systems usually acquire multiple images of the same 3D scene from different viewpoin ...
We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset up ...
Recently, it has been shown that a quantize-map-and-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitrary topologies [1]. This was established using Gaussian codebooks for transmission an ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010
The issue of how to efficiently represent the data collected by a network of microphones recording spatio-temporal acoustic wave fields is addressed. Each sensor node in the network samples the sound field, quantizes the samples and transmits the encoded s ...
We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset uppe ...
In this paper we find properties that are shared between two seemingly unrelated lossy source coding setups with side information. The first setup is when the source and side information are jointly Gaussian and the distortion measure is quadratic. The sec ...
In this paper we find properties that are shared between two seemingly unrelated lossy source coding setups with side-information. The first setup is when the source and side-information are jointly Gaussian and the distortion measure is quadratic. The sec ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
