This work is motivated by the problem of error correction in bit-shift channels with the so-
called (d, k) input constraints (where successive 1's are required to be separated by at least …

In their" Bits Through Queues" paper, Anantharam and Verdú showed that if the service time
is memoryless feedback does not increase capacity under a FIFO policy, and further …

This paper begins a systematic study of the zeroerror capacity problem of broadcast
channels, where the message sent can be decoded by each receiver with zero error. A …

In the classical “Bits Through Queues” paper, it was hypothesized that full feedback always
increases the capacity of first-in-first-out queues, except when the service time distribution is …

We investigate state estimation of linear systems over channels having a finite state not
known by the transmitter or receiver. We show that similar to memoryless channels, zero …

A zero-error coding scheme of asymptotic rate log 2 (1+√ 5)-1 was recently described for a
communication channel composed of parallel asynchronous lines satisfying the so-called no …

This paper presents the first systematic study of the zero-error capacity regions of noisy
networks. First, we consider two simple such networks, each consisting of a stationary …

We propose a new approach to construct optimal zero-error codes, based on the
concatenation of words of variable length, taken from a generator set. Two zero-error …

This work is motivated by the problem of error correction in bit-shift channels with the so-
called (d, k) input constraints (where successive 1's are required to be separated by at least …

We study the error detection problem in q-ary asymmetric channels, wherein every input
symbol xi is mapped to an output symbol yi satisfying yi≥ x i. A general setting is assumed …