Slepian–Wolf coding

Known as: Slepian-Wolf bound, Slepian-Wolf coding, Slepian–Wolf bound 
In information theory and communication, the Slepian–Wolf coding, also known as the Slepian–Wolf bound, is a fundamental result in distributed source… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We characterize second-order coding rates (or dispersions) for distributed lossless source coding (the Slepian-Wolf problem). We… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay… (More)
  • figure 1
  • figure 2
  • table I
  • table II
Is this relevant?
2011
2011
Error correcting codes used for Distributed Source Coding (DSC) generally assume a random distribution of errors. However, in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2011
Review
2011
This chapter deals with practical solutions for the Slepian Wolf (SW) coding problem, which refers to the problem of lossless… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
In this paper, the redundancy of both variable and fixed rate Slepian-Wolf coding is considered. Given any jointly memoryless… (More)
  • figure 1
Is this relevant?
2009
2009
We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Lower and upper bounds on the reliability region of universal variable-rate Slepian-Wolf coding are derived. 
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We discuss reliable transmission of a discrete memoryless source over a discrete memoryless broadcast channel, where each… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
The results of Shannon theory are asymptotic and do not reflect the finite codeword lengths used in practice. Recent progress in… (More)
Is this relevant?
2004
2004
We present a strategy for Slepian-Wolf coding when the joint distribution of the sources is unknown. The encoders use an… (More)
  • figure 1
  • figure 2
Is this relevant?