Building upon Slepian-Wolf coding, sparse-graph codes, belief propagation, and closed-loop iterative doping, we propose new schemes for interactive data exchange between two agents who want to communicate losslessly their respective information via several rounds of communication.

We present a fast two-phase algorithm for super-resolution with strong theoretical guaran-tees. Given the low-frequency part of the spectrum of a sequence of impulses, Phase I consistsof a greedy algorithm that roughly estimates the impulse positions. These estimates are thenrefined by local optimization in Phase II.In contrast to the convex relaxation proposed by Candès et ...

ABSTRACT We review the construction of three different Slepian bases on the sphere, and illustrate their theoretical behavior and practical use for solving ill-posed satellite inverse problems. The first basis is scalar, the second vectorial, and the third suitable for the vector representation of the harmonic potential fields on which we focus our analysis. When data are noisy and incompletely...

In this work we consider a quantum generalization of the task considered by Slepian andWolf [1] regarding distributed source compression. In our task Alice, Bob, Charlie and Reference share a joint pure state. Alice and Bob wish to send a part of their respective systems to Charlie without collaborating with each other. We give achievability bounds for this task in the one-shot setting and prov...

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...

The estimation of potential fields such as the gravitational or magnetic potential at the surface of a spherical planet from noisy observations taken at an altitude over an incomplete portion of the globe is a classic example of an ill-posed inverse problem. Here we show that the geodetic estimation problem has deep-seated connections to Slepian’s spatiospectral localization problem on the sphe...

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...