We review some recent results on the information-theoretic treatment of coordination in networks. In particular, we present some results from a recent paper by Cuff, Permuter and ...
A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasistati...
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Floating codes are codes designed to store multiple values in a Write Asymmetric Memory, with applications to flash memory. In this model, a memory consists of a block of n cells, ...
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
Faruck Morcos, Marcin Sikora, Mark S. Alber, Dale ...
For adversarial but computationally bounded models of error, we construct appealingly simple and efficient cryptographic encoding and unique decoding schemes whose error-correctio...
Silvio Micali, Chris Peikert, Madhu Sudan, David A...
We investigate the linear precoding and power allocation policies that maximize the mutual information for general multiple-input multiple-output (MIMO) Gaussian channels with arb...
Abstract-- The problem of universal simulation given a training sequence is studied both in a stochastic setting and for individual sequences. In the stochastic setting, the traini...
Many recent works that study the performance of multi-input multi-output (MIMO) systems in practice assume a Kronecker model where the variances of the channel entries, upon decom...
Vasanthan Raghavan, Jayesh H. Kotecha, Akbar M. Sa...