Probabilistic distances between finite-state finite-alphabet hidden Markov models

DOI10.1109/TAC.2005.844896zbMath1365.60066OpenAlexW2154867710MaRDI QIDQ5274034

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

Publication date: 12 July 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2005.844896

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Channel models (including quantum) in information and communication theory (94A40)

Related Items (2)

Airborne vision-based collision-detection system ⋮ Chain Rule Optimal Transport

This page was built for publication: Probabilistic distances between finite-state finite-alphabet hidden Markov models