We present a strategy for Slepian-Wolf coding when the joint distribution of the sources is unknown. The encoders use an incremental transmission policy, and the decoder a universal sequential decision test. We show that the decoder is able to decode shortly after the rates of transmission exceed the Slepian-Wolf bounds. The decoder then send an ACK back to the encoders, terminating transmissio...

We consider a setting of Slepian–Wolf coding, where the random bin of the source vector undergoes channel coding, and then decoded at the receiver, based on additional side information, correlated to the source. For a given distribution of the randomly selected channel codewords, we propose a universal decoder that depends on the statistics of neither the correlated sources nor the channel, ass...

Slepian, Masicampo, Toosi, and Ambady (Journal of Experimental Psychology: General, 141, 619-624, 2012, Study 1) found that individuals recalling and writing about a big, meaningful secret judged a pictured hill as steeper than did those who recalled and wrote about a small, inconsequential secret (with estimates unrelated to physical effort unaffected). From an embodied cognition perspective, ...

We study the following combinatorial version of the Slepian–Wolf coding scheme. Two isolated Senders are given binary strings X and Y respectively; the length of each string is equal to n, and the Hamming distance between the strings is at most αn. The Senders compress their strings and communicate the results to the Receiver. Then the Receiver must reconstruct both strings X and Y . The aim is...

We analyze the asymptotic performance of ensembles of random binning Slepian-Wolf codes, where each type class of the source might have a different coding rate. In particular, we first provide the exact encoder excess rate exponent as well as the decoder error exponent. Then, using the error exponent expression, we determine the optimal rate function, namely, the minimal rate for each type clas...

Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed “distributed arithmetic coding”, which exploits the fact that arithmetic codes are good source as well as channel codes. In particular, we propose a distributed binary arithmetic coder for Slepian-Wolf coding with decoder side information, along wit...

A three terminal relay system with binary erasure channel (BEC) was considered, in which a source forwarded information to a destination with a relay’s ”assistance”. The nested LDGM (Low-density generator-matrix) -LDPC (lowdensity parity-check) was designed to realize Compress-andforward (CF) at the relay. LDGM coding compressed the received signals losslessly and LDPC realized the binning for ...