Novel lower bounds on the entropy rate of binary hidden Markov processes.

Published in: ISIT (2016)

Keyphrases

markov processes
lower bound
markov process
markov chain
upper bound
stochastic processes
code length
random fields
non stationary
continuous time bayesian networks
continuous time markov chains
np hard
objective function
search algorithm
hidden markov models
random walk