A simple and efficient solution of the identifiability problem for hidden markov sources and quantum random walks

2008 International Symposium on Information Theory and its Applications, ISITA2008

Volumn , Issue , 2008, Pages

  Schönhuth, Alexander ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC THEORIES; ERGODICITY; HIDDEN STATE; IDENTIFIABILITY; MARKOV CHAIN; MARKOV SOURCES; OPEN PROBLEMS; PRACTICAL ALGORITHMS; QUANTUM INFORMATION THEORY; QUANTUM RANDOM WALKS; RANDOM SOURCES;

INFORMATION THEORY; QUANTUM OPTICS;

HIDDEN MARKOV MODELS;

EID: 77951143316     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISITA.2008.4895457     Document Type: Conference Paper

References (6)

1. D. Aharonov, A. Ambainis, J. Kempe, U. Vazirani: "Quantum walks on graphs", Proc. of 33rd ACM STOC, New York, pp. 50-59, 2001.
2. D. Blackwell and L. Koopmans: "On the identifiability problem for functions of finite Markov chains", Annals of Mathematical Statistics, vol.28, pp. 1011-1015, 1957.
3. H. Ito, S.-I. Amari and K. Kobayashi: "Identifiability of hidden Markov information sources and their minimum degrees of freedom", IEEE Trans. Inf. Theory, vol.38(2), pp. 324-333, 1992.
4. H. Jäger: "Observable operator models for discrete stochastic time series", Neural Computation, vol.12(6), pp. 1371-1398, 2000.
5. Y. Ephraim, N. Merhav, "Hidden Markov processes", IEEE Trans. on Information Theory, vol.48(6), pp. 1518-1569, 2002.
6. A. Schönhuth and H. Jäger: "Characterization of ergodic hidden Markov sources", http: //www.zaik.uni-koeln.de/~paper/ index.html?show=zaik2008-573, submitted to IEEE Transactions on Information Theory