Slepian-Wolf coding over broadcast channels
E Tuncel - IEEE Transactions on Information Theory, 2006 - ieeexplore.ieee.org
We discuss reliable transmission of a discrete memoryless source over a discrete
memoryless broadcast channel, where each receiver has side information (of arbitrary …
memoryless broadcast channel, where each receiver has side information (of arbitrary …
Wyner–Ziv coding over broadcast channels: Digital schemes
This paper addresses lossy transmission of a common source over a broadcast channel
when there is correlated side information at the receivers, with emphasis on the quadratic …
when there is correlated side information at the receivers, with emphasis on the quadratic …
On code design for the Slepian-Wolf problem and lossless multiterminal networks
A Slepian-Wolf coding scheme for compressing two uniform memoryless binary sources
using a single channel code that can achieve arbitrary rate allocation among encoders was …
using a single channel code that can achieve arbitrary rate allocation among encoders was …
Asynchronous Slepian-Wolf coding via source-splitting
The Slepian-Wolf coding problem for two sources is considered. It is known that vertices of
the Slepian-Wolf region can be achieved with a complexity which is significantly lower than …
the Slepian-Wolf region can be achieved with a complexity which is significantly lower than …
Symmetric and asymmetric Slepian-Wolf codes with systematic and nonsystematic linear codes
N Gehrig, PL Dragotti - IEEE communications letters, 2005 - ieeexplore.ieee.org
We propose a constructive approach for distributed source coding of correlated binary
sources using linear channel codes that can achieve any point of the Slepian-Wolf …
sources using linear channel codes that can achieve any point of the Slepian-Wolf …
Design of Slepian-Wolf codes by channel code partitioning
A Slepian-Wolf coding scheme that can achieve arbitrary rate allocation among two
encoders was outlined in the work of Pradhan and Ramchandran. Inspired by this work, we …
encoders was outlined in the work of Pradhan and Ramchandran. Inspired by this work, we …
On the dispersions of three network information theory problems
We analyze the dispersions of distributed lossless source coding (the Slepian-Wolf
problem), the multiple-access channel, and the asymmetric broadcast channel. For the two …
problem), the multiple-access channel, and the asymmetric broadcast channel. For the two …
Second-order Slepian-Wolf coding theorems for non-mixed and mixed sources
R Nomura - IEEE transactions on information theory, 2014 - ieeexplore.ieee.org
The second-order achievable rate region in Slepian-Wolf source coding systems is
investigated. The concept of second-order achievable rates, which enables us to make a …
investigated. The concept of second-order achievable rates, which enables us to make a …
On the redundancy of Slepian–Wolf coding
D He, LA Lastras-Montano, E Yang… - IEEE transactions on …, 2009 - ieeexplore.ieee.org
In this paper, the redundancy of both variable and fixed rate Slepian–Wolf coding is
considered. Given any jointly memoryless source-side information pair {(X_i,Y_i)\}_i=1^∞ …
considered. Given any jointly memoryless source-side information pair {(X_i,Y_i)\}_i=1^∞ …
An algebraic construction of codes for Slepian-Wolf source networks
T Uyematsu - IEEE Transactions on Information Theory, 2001 - ieeexplore.ieee.org
This article proposes an explicit construction of fixed-length codes for Slepian-Wolf (1973)
source networks. The proposed code is linear, and has two-step encoding and decoding …
source networks. The proposed code is linear, and has two-step encoding and decoding …