Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
CodecCommunication sourceDISCUSData compression

Broader (1)

Error detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Kolmogorov complexity version of Slepian-Wolf coding
Alice and Bob are given two correlated n-bit strings x1 and, respectively, x2, which they want to losslessly compress and send to… 
2013
2013
Asymmetric Slepian-Wolf Coding of Nonstationarily-Correlated M-ary Sources with Sliding-Window Belief Propagation
Asymmetric Slepian-Wolf coding (ASWC) of M-ary sources with nonstationary correlation is a very useful model for many practical… 
2012
2012
The dispersion of Slepian-Wolf coding
We characterize second-order coding rates (or dispersions) for distributed lossless source coding (the Slepian-Wolf problem). We… 
2009
2009
A flexible rate slepian-wolf code construction
A flexible rate Slepian-Wolf (SW) code is constructed, which is vital for wireless sensor network applications. The proposed… 
2008
2008
“Real” Slepian-Wolf codes
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that… 
2007
2007
Rateless Slepian-Wolf Coding Based on Rate Adaptive Low-Density-Parity-Check Codes
A rateless Slepian-Wolf coding (SWC) scheme based on rate adaptive low-density-parity-check (LDPC) codes is presented. We first… 
2006
2006
On the Relationship between Redundancy and Decoding Error in Slepian-Wolf Coding
The relationship between redundancy and decoding error in Slepian-Wolf coding with one encoder is investigated. For any… 
2005
2005
Rateless Slepian-Wolf Codes
  • A. EckfordWei Yu
  • Conference Record of the Thirty-Ninth Asilomar…
  • 2005
  • Corpus ID: 3043927
The design and optimization of rateless codes for Slepian-Wolf encoding are considered. Rateless codes are pro- posed to address… 
2005
2005
Non-Asymptotic Performance of Symmetric Slepian-Wolf Coding
Like most results in information theory, the classical Slepian-Wolf theorem is asymptotic. We characterize how quickly the limits… 
2004
2004
Redundancy Rates of Slepian-Wolf Coding ∗
The results of Shannon theory are asymptotic and do not reflect the finite codeword lengths used in practice. Recent progress in… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)