We consider a line network of nodes, connected by additive white noise channels, equipped
with local feedback. We study the velocity at which information spreads over this network …

In this paper, we study the problem of relaying a single bit of information across a series of
binary symmetric channels, and the associated trade-off between the number of hops, the …

We consider a line network of nodes connected by additive white Gaussian noise channels
and equipped with local feedback. We study the velocity at which information spreads over …

We study error exponents for the problem of low-rate communication over a directed graph,
where each edge in the graph represents a noisy communication channel, and there is a …

In this paper, we study the problem of relaying a single bit over a tandem of binary-input
channels, with the goal of attaining the highest possible error exponent in the exponentially …

Abstract Information theory has allowed us to determine the fundamental limit of various
communication and algorithmic problems, eg, the channel coding problem, the compression …

In this paper, we study the problem of relaying a single bit of information across a series of
binary symmetric channels, and the associated trade-off between the number of hops m, the …