A Posteriori Probability Distances Between Finite-Alphabet Hidden Markov Models

DOI10.1109/TIT.2006.887076zbMath1310.60107OpenAlexW2131865294MaRDI QIDQ3548233

Valery A. Ugrinovskii, Li Xie, Ian R. Petersen

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2006.887076

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Information theory (general) (94A15)

Related Items (1)

Event-triggered minimax state estimation with a relative entropy constraint

This page was built for publication: A Posteriori Probability Distances Between Finite-Alphabet Hidden Markov Models