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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
.............................................................................................................................. ii… 
2009
2009
The lack of HCI offerings in the invention of novel software applications and the bias of design knowledge towards desktop GUI… 
2008
2008
PCT No. PCT/DE94/01535 Sec. 371 Date Dec. 2, 1996 Sec. 102(e) Date Dec. 2, 1996 PCT Filed Dec. 24, 1994 PCT Pub. No. WO95/19244… 
2005
2005
Like most results in information theory, the classical Slepian-Wolf theorem is asymptotic. We characterize how quickly the limits… 
2004
2004
The results of Shannon theory are asymptotic and do not reflect the finite codeword lengths used in practice. Recent progress in… 
2004
2004
Multiterminal (MT) source coding refers to separate lossy encoding and joint decoding of multiple correlated sources. This paper… 
2000
2000
Introduction Stereolithography has become a wellknown technique in the rapid prototyping sector. In preoperative model planning… 
Review
1990
Review
1990
It is easier to monitor the spawning area of the Pacific sardine than to mount a full-scale effort to precisely estimate spawning… 
1973
1973
We consider an n -dimensional vector space over GF(q) which has a probability distribution defined on it. The sum of the…