Asymptotics of input-constrained binary symmetric channel capacity
From MaRDI portal
Publication:2389603
DOI10.1214/08-AAP570zbMath1167.94322arXiv0803.3360OpenAlexW2152773357MaRDI QIDQ2389603
Publication date: 17 July 2009
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.3360
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Special processes (60K99) Information theory (general) (94A15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- On the entropy of a hidden Markov process
- Analycity properties of the characteristic exponents of random matrix products
- Domains of analytic continuation for the top Lyapunov exponent
- Evolutionary formalism for products of positive random matrices
- An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices
- The entropy of a binary hidden Markov process
- On the capacity of binary and Gaussian channels with run-length-limited inputs
- On the optimality of symbol-by-symbol filtering and denoising
- Analyticity of Entropy Rate of Hidden Markov Chains
- Simulation-Based Computation of Information Rates for Channels With Memory
- Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices
- Derivatives of Entropy Rate in Special Families of Hidden Markov Chains
- A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels
- On runlength codes
- Approximations for the Entropy for Functions of Markov Chains
- Hidden Markov processes
- An Introduction to Symbolic Dynamics and Coding
- Entropy of a bit-shift channel
- Intrinsic Markov Chains
- An algorithm for computing the capacity of arbitrary discrete memoryless channels
- Computation of channel capacity and rate-distortion functions
This page was built for publication: Asymptotics of input-constrained binary symmetric channel capacity
