Results 11  20
of
50
On the capacity of the discrete memoryless broadcast channel with feedback
 IEEE Trans. Inf. Theory
, 2013
"... ar ..."
(Show Context)
Correlated source coding for fusion storage and selective retrieval
 in IEEE International Symposium on Information Theory, 2005
"... Abstract — Motivated by the sensor network setting, we consider lossless storage of correlated discrete memoryless sources. The underlying tradeoff is between exploitation of intersource correlation for low rate storage and efficient (low rate) selective retrieval from the fusion storage. We define ..."
Abstract

Cited by 13 (12 self)
 Add to MetaCart
(Show Context)
Abstract — Motivated by the sensor network setting, we consider lossless storage of correlated discrete memoryless sources. The underlying tradeoff is between exploitation of intersource correlation for low rate storage and efficient (low rate) selective retrieval from the fusion storage. We define the problem of shared descriptions (SD) source coding and relate it to the storage and retrieval problem. We present an achievable rate region for the SD problem and use it to characterize the storage vs. retrieval tradeoff. I.
A new dual to the GácsKörner common information defined via the GrayWyner system
"... Abstract — We consider jointly distributed random variables X and Y. After describing the GácsKörner common information between the random variables from the viewpoint of the capacity region of the GrayWyner system, we propose a new notion of common information between the random variables that is ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
Abstract — We consider jointly distributed random variables X and Y. After describing the GácsKörner common information between the random variables from the viewpoint of the capacity region of the GrayWyner system, we propose a new notion of common information between the random variables that is dual to the GácsKörner common information, from this viewpoint, in a welldefined sense. We characterize this quantity explicitly in terms of two auxiliary quantities that are asymmetric in nature, and illustrate the operational significance of these new quantities by characterizing a corner point of the solution to a problem of source coding with sideinformation in terms of them. We also contrast this new concept of common information for a pair of random variables with the Wyner common information of the random variables, which is also a kind of dual to the GácsKörner common information. I.
Correlated sources over broadcast channels
 in Proc. IEEE Int. Symp. Inf. Theory
, 2009
"... Abstract—An alternative characterization is given for the coding theorem by Han and Costa, which finds a set of admissible source pairs that can be transmitted reliably over the broadcast channel. The associated coding technique is conceptually simpler and the resulting admissible source region can ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Abstract—An alternative characterization is given for the coding theorem by Han and Costa, which finds a set of admissible source pairs that can be transmitted reliably over the broadcast channel. The associated coding technique is conceptually simpler and the resulting admissible source region can be shown to include the Gray–Wyner distributed source coding region in a straightforward manner. Incidentally, this new characterization illustrates how the common part between the two random sources does not play any role in broadcasting correlated sources, unlike transmission of correlated sources over the multiple access channel. I.
Practical MultiResolution Source Coding: TSVQ Revisited
 In Proceedings of the Data Compression Conference, pages 5362, Snowbird, UT
, 1998
"... Consider a multiresolution source code for describing a stationary source at L resolutions. The description at the first resolution is given at rate R 1 and achieves an expected distortion no greater than D 1 . The description at the second resolution includes both the first description and a refin ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
Consider a multiresolution source code for describing a stationary source at L resolutions. The description at the first resolution is given at rate R 1 and achieves an expected distortion no greater than D 1 . The description at the second resolution includes both the first description and a refining description of rate R 2 and achieves expected distortion no greater than D 2 , and so on. Recently derived multiresolution source coding bounds describe the family of achievable rate and distortion vectors ((R 1 ; R 2 ; : : : ; R L ); (D 1 ; D 2 ; : : : ; D L )). By examining these multiresolution ratedistortion bounds, we gain insight into the problem of practical multiresolution source coding. These insights lead to a new multiresolution source code based on the treestructured vector quantizer. This paper covers the algorithm, its optimal design, and preliminary experimental results. I Introduction With advances in communications media and technologies come needs for communicatio...
On source coding with coded side information for a binary source with binary side information
 in Proc. ISIT
, 2007
"... Abstract — The lossless rate region for the coded side information problem is “solved, ” but its solution is expressed in terms of an auxiliary random variable. As a result, finding the rate region for any fixed example requires an optimization over a family of allowed auxiliary random variables. Wh ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Abstract — The lossless rate region for the coded side information problem is “solved, ” but its solution is expressed in terms of an auxiliary random variable. As a result, finding the rate region for any fixed example requires an optimization over a family of allowed auxiliary random variables. While intuitive constructions are easy to come by and optimal solutions are known under some special conditions, proving the optimal solution is surprisingly difficult even for examples as basic as a binary source with binary side information. We derive the optimal auxiliary random variables and corresponding achievable rate regions for a family of problems where both the source and side information are binary. Our solution involves first tightening known bounds on the alphabet size of the auxiliary random variable and then optimizing the auxiliary random variable subject to this constraint. The technique used to tighten the bound on the alphabet size applies to a variety of problems beyond the one studied here. I.
On Source and Channel Codes for Multiple Inputs and Outputs
 Does Multiple Description Beat Space Time?, ” Information Theory Workshop
, 2004
"... Abstract — We compare two strategies for lossy source description across a pair of unreliable channels. In the first strategy, we use a broadcast channel code to achieve a different rate for each possible channel realization, and then use a multiresolution source code to describe the source at the r ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
Abstract — We compare two strategies for lossy source description across a pair of unreliable channels. In the first strategy, we use a broadcast channel code to achieve a different rate for each possible channel realization, and then use a multiresolution source code to describe the source at the resulting rates. In the second strategy, we use a channel coding strategy for two independent channels coupled with a multiple description source code. In each case, we choose the coding parameters to minimize the expected endtoend distortion in the source reconstruction. We demonstrate that in pointtopoint communication across a pair of nonergodic channels, multiple description coding can provide substantial gains relative to mulitresolution and broadcast coding. We then investigate this comparison in a simple MIMO channel. We demonstrate the inferior performance of space time coding with multiresolution source coding and broadcast channel coding relative to multiple description codes and a time sharing channel coding strategy. These results indicate that for nonergodic channels, the traditional definition of channel capacity does not necessarily lead to the best channel code from the perspective of endtoend source distortion. I.
An Achievable Rate Region for the Broadcast Channel with Feedback
, 2011
"... A singleletter achievable rate region is proposed for the tworeceiver discrete memoryless broadcast channel with noiseless or noisy feedback. The coding strategy involves blockMarkov superposition coding using Marton’s coding scheme for the broadcast channel without feedback as the starting point ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
A singleletter achievable rate region is proposed for the tworeceiver discrete memoryless broadcast channel with noiseless or noisy feedback. The coding strategy involves blockMarkov superposition coding using Marton’s coding scheme for the broadcast channel without feedback as the starting point. If the message rates in the Marton scheme are too high to be decoded at the end of a block, each receiver is left with a list of messages compatible with its output. Resolution information is sent in the following block to enable each receiver to resolve its list. The key observation is that the resolution information of the first receiver is correlated with that of the second. This correlated information is efficiently transmitted via joint sourcechannel coding, using ideas similar to the HanCosta coding scheme. The proposed rate region is computed for two examples, including the degraded AWGN broadcast channel, which show that the region can be strictly larger than the capacity region in the absence of feedback. Finally, the proposed rate region is shown to contain the achievable region proposed independently by Shayevitz and Wigger under certain mild conditions. 1
Source coding theory for a triangular communication system
 IEEE Trans. Inf. Theory
, 1996
"... © 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
© 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in
Packetizing for the erasure broadcast channel with an internet application
 in Proc. Int. Conf. on Combinatorics, Information Theory and Statistics
, 1997
"... ..."
(Show Context)