We consider the classical two-encoder multiterminal source coding problem where distortion
is measured under logarithmic loss. We provide a single-letter description of the achievable …

Long-read sequencing technologies have the potential to produce gold-standard de novo
genome assemblies, but fully exploiting error-prone reads to resolve repeats remains a …

Consider a noisy linear observation model with an unknown permutation, based on observing
y = Π* Ax* + w, where x* ∈ ℝ d is an unknown vector, Π* is an unknown nxn permutation …

We consider the multivariate linear regression model with shuffled data and additive noise,
which arises in various correspondence estimation and matching problems. We focus on the …

We establish existence of Stein kernels for probability measures on $\mathbb{R}^{d}$ satisfying
a Poincaré inequality, and obtain bounds on the Stein discrepancy of such measures. …

Consider a connected network of n nodes that all wish to recover k desired packets. Each
node begins with a subset of the desired packets and exchanges coded packets with its …

We consider a natural measure of relevance: the reduction in optimal prediction risk in the
presence of side information. For any given loss function, this relevance measure captures the …

We pose a simply stated conjecture regarding the maximum mutual information a Boolean
function can reveal about noisy inputs. Specifically, let X n be independent identically …

Consider a noisy linear observation model with an unknown permutation, based on observing
y = Π*Ax* + w, where x* ∈ ℝ d is an unknown vector, Π* is an unknown n × n permutation …

For a block-fading channel, this paper optimizes the allocation of redundancy between
packet-level erasure coding (which provides additional packets to compensate for packet loss) …