Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Finite state channels with time-invariant deterministic feedback
IEEE Transactions on Information Theory
Capacity, mutual information, and coding for finite-state Markov channels
IEEE Transactions on Information Theory
The compound channel capacity of a class of finite-state channels
IEEE Transactions on Information Theory
An information-spectrum approach to capacity theorems for the general multiple-access channel
IEEE Transactions on Information Theory
Capacity results for the discrete memoryless network
IEEE Transactions on Information Theory
The capacity of finite-State Markov Channels With feedback
IEEE Transactions on Information Theory
Feedback capacity of finite-state machine channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On information transmission over a finite buffer channel
IEEE Transactions on Information Theory
Feedback capacity of the first-order moving average Gaussian channel
IEEE Transactions on Information Theory
Coding for the Feedback Gel'fand–Pinsker Channel and the Feedforward Wyner–Ziv Source
IEEE Transactions on Information Theory
On the Feedback Capacity of Power-Constrained Gaussian Noise Channels With Memory
IEEE Transactions on Information Theory
A Coding Theorem for a Class of Stationary Channels With Feedback
IEEE Transactions on Information Theory
Capacity of the Trapdoor Channel With Feedback
IEEE Transactions on Information Theory
Achieving the Gaussian Rate–Distortion Function by Prediction
IEEE Transactions on Information Theory
Coding for Additive White Noise Channels With Feedback Corrupted by Quantization or Bounded Noise
IEEE Transactions on Information Theory
The source-channel separation theorem revisited
IEEE Transactions on Information Theory
Feedback does not increase the capacity of discrete channels with additive noise
IEEE Transactions on Information Theory
The capacity region of the degraded finite-state broadcast channel
IEEE Transactions on Information Theory
Tighter bounds on the capacity of finite-state channels via Markov set-chains
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Channel capacity bounds in the presence of quantized channel state information
EURASIP Journal on Wireless Communications and Networking
| Hi-index | 755.02 |
The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We characterize both an inner and an outer bound for this region, using Massey's directed information. These bounds are shown to coincide, and hence yield the capacity region, of indecomposable FS-MACs without feedback and of stationary and indecomposable FS-MACs with feedback, where the state process is not affected by the inputs. Though "multiletter" in general, our results yield explicit conclusions when applied to specific scenarios of interest. For example, our results allow us to do the following. • Identify a large class of FS-MACs, that includes the additive mod2 noise MAC where the noise may have memory, for which feedback does not enlarge the capacity region. • Deduce that, for a general FS-MAC with states that are not affected by the input, if the capacity (region) without feedback is zero, then so is the capacity (region) with feedback. • Deduce that the capacity region of aMAC that can be decomposed into a "multiplexer" concatenated by a point-to-point channel (with, without, or with partial feedback), the capacity region is given by Σm Rm ≤ C, where C is the capacity of the point to point channel and m indexes the encoders. Moreover, we show that for this family of channels source-channel coding separation holds.