Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures

DOI10.1109/18.335958zbMath0811.94022OpenAlexW2130615511WikidataQ105584757 ScholiaQ105584757MaRDI QIDQ4324179

Prakash Narayan, Chuang-Chun Liu

Publication date: 1 March 1995

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

Full work available at URL: https://semanticscholar.org/paper/93f721012c3d1d9e2cf8295c0af8ef65e58cbc08

zbMATH Keywords

estimatormixture distributionorder estimatoruniversal data compressionaverage redundancyhidden Markov source (HMS)pointwise redundancyuniquely decodable

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (6)

Large-Scale Multiple Testing under Dependence ⋮ SPRT and CUSUM in hidden Markov models ⋮ Penalized estimate of the number of states in Gaussian linear AR with Markov regime ⋮ Relevant states and memory in Markov chain bootstrapping and simulation ⋮ Estimating the order of a hidden markov model ⋮ Number of hidden states and memory: a joint order estimation problem for Markov chains with Markov regime

This page was built for publication: Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures