The capacity region of the degraded finite-state broadcast channel

Authors:
Ron Dabora;Andrea J. Goldsmith
Affiliations:
Department of Electrical and Computer Engineering, Ben-Gurion University, Be'er-Sheva, Israel;Department of Electrical Engineering, Stanford University, Stanford, CA
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 13
Cited 1

Elements of information theory

Elements of information theory
Information Theory and Reliable Communication

Information Theory and Reliable Communication
The capacity of channels with feedback

IEEE Transactions on Information Theory
Optimization of information rate upper and lower bounds for channels with memory

IEEE Transactions on Information Theory
Capacity region of the finite-state multiple-access channel with and without 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
Reliable communication under channel uncertainty

IEEE Transactions on Information Theory
The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise

IEEE Transactions on Information Theory
Capacity results for the discrete memoryless network

IEEE Transactions on Information Theory
Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information

IEEE Transactions on Information Theory
Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices

IEEE Transactions on Information Theory
Capacity of the Trapdoor Channel With Feedback

IEEE Transactions on Information Theory

Capacity theorems for discrete, finite-state broadcast channels with feedback and unidirectional receiver cooperation

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

We introduce and study the discrete, finite-state broadcast channel (FSBC) with memory. For this class of channels we define physical degradedness and stochastic degradedness, and demonstrate these definitions with practical communication scenarios. We then show that a superposition codebook with memory achieves the capacity region of physically degraded FSBCs. This result is subsequently used to characterize the capacity region of stochastically degraded FSBCs. In both scenarios, we consider indecomposable as well as nonindecomposable channels.