Tighter bounds on the capacity of finite-state channels via Markov set-chains

Authors:
Jun Chen;Haim Permuter;Tsachy Weissman
Affiliations:
Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada;Department of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer-Sheva, Israel and Department of Electrical Engineering, Stanford University, Stanford, CA;Department of Electrical Engineering, Stanford University, Stanford, CA
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 7
Cited 0

Ergodicity of Markov channels

IEEE Transactions on Information Theory
Information Theory and Reliable Communication

Information Theory and Reliable Communication
Finite state channels with time-invariant deterministic feedback

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
Simulation-Based Computation of Information Rates for Channels With Memory

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

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new bounds coincide and yield single-letter capacity characterizations for a class of channels with the state process known at the receiver, including channels whose long-term marginal state distribution is independent of the input process. Analogous results are established for finite-state multiple access channels.