State learning and mixing in entropy of hidden Markov processes and the Gilbert-Elliott channel
DOI10.1109/18.746777zbMATH Open0945.94010OpenAlexW2126785155MaRDI QIDQ4701247FDOQ4701247
Authors: Bertrand Hochwald, Predrag R. Jelenković
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.746777
Recommendations
- On the Entropy Rate of Hidden Markov Processes Observed Through Arbitrary Memoryless Channels
- Event-Based State Estimation of Hidden Markov Models Through a Gilbert–Elliott Channel
- On the entropy of a hidden Markov process
- State estimation of dynamical systems with unknown inputs: entropy and bit rates
- Conditional entropy theorem for recursive parameter estimation and its application to state estimation problems
- Entropy and Minimal Bit Rates for State Estimation and Model Detection
- Bounds on the entropy rate of binary hidden Markov processes
- Entropy and minimal data rates for state estimation and model detection
- Shannon entropy rate of hidden Markov processes
- Capacity, mutual information, and coding for finite-state Markov channels
Markov chainupper boundMarkov-modulated random walkfading channelBirkhoff contraction coefficientGilbert-Elliott channelfinite-past approximation
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Channel models (including quantum) in information and communication theory (94A40)
Cited In (3)
This page was built for publication: State learning and mixing in entropy of hidden Markov processes and the Gilbert-Elliott channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701247)