Asymptotics of input-constrained binary symmetric channel capacity
From MaRDI portal
Abstract: We study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from a constrained set. Motivated by a result of Ordentlich and Weissman [In Proceedings of IEEE Information Theory Workshop (2004) 117--122], we derive an asymptotic formula (when the noise parameter is small) for the entropy rate of a hidden Markov chain, observed when a Markov chain passes through a BSC. Using this result, we establish an asymptotic formula for the capacity of a BSC with input process supported on an irreducible finite type constraint, as the noise parameter tends to zero.
Recommendations
- Asymptotics of Input-Constrained Erasure Channel Capacity
- $\epsilon$-Capacity of Binary Symmetric Averaged Channels
- scientific article; zbMATH DE number 3453478
- On the asymptotic capacity of a multi-access channel
- Bounds on the zero-error capacity of the input-constrained bit-shift channel
- On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels
- Upper and lower bounds on the binary input AWGN channel capacity
- The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
- A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
- Capacity Bounds for Additive Symmetric $\alpha $ -Stable Noise Channels
Cites work
- scientific article; zbMATH DE number 3139241 (Why is no real title available?)
- scientific article; zbMATH DE number 19536 (Why is no real title available?)
- scientific article; zbMATH DE number 48436 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1284433 (Why is no real title available?)
- A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels
- A Mathematical Theory of Communication
- An Introduction to Symbolic Dynamics and Coding
- An algorithm for computing the capacity of arbitrary discrete memoryless channels
- An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices
- Analycity properties of the characteristic exponents of random matrix products
- Analyticity of Entropy Rate of Hidden Markov Chains
- Approximations for the Entropy for Functions of Markov Chains
- Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices
- Computation of channel capacity and rate-distortion functions
- Derivatives of Entropy Rate in Special Families of Hidden Markov Chains
- Domains of analytic continuation for the top Lyapunov exponent
- Entropy of a bit-shift channel
- Evolutionary formalism for products of positive random matrices
- Hidden Markov processes
- Intrinsic Markov Chains
- On runlength codes
- On the capacity of binary and Gaussian channels with run-length-limited inputs
- On the entropy of a hidden Markov process
- On the optimality of symbol-by-symbol filtering and denoising
- Simulation-Based Computation of Information Rates for Channels With Memory
- The entropy of a binary hidden Markov process
Cited in
(10)- On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels
- scientific article; zbMATH DE number 3494264 (Why is no real title available?)
- Capacity Bounds for Additive Symmetric $\alpha $ -Stable Noise Channels
- On Capacity Formulation With Stationary Inputs and Application to a Bit-Patterned Media Recording Channel Model
- The capacity of finite-state channels in the high-noise regime
- scientific article; zbMATH DE number 3412509 (Why is no real title available?)
- Constructive Bounds on the Capacity of Parallel Asynchronous Skew-Free Channels With Glitches
- A combinatorial lemma and Shannon's theorem for binary symmetric channels
- $\epsilon$-Capacity of Binary Symmetric Averaged Channels
- Expurgated Bounds for the Asymmetric Broadcast Channel
This page was built for publication: Asymptotics of input-constrained binary symmetric channel capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389603)
