Estimating the Number of States of a Finite-State Source

IEEE Transactions on Information Theory

Volumn 38, Issue 1, 1992, Pages 61-65

  Ziv, Jacob ^a   Merhav, Neri ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

finite state sources; hidden Markov models; Lempel Ziv algorithm; Model order estimation; universal data compression

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; INFORMATION THEORY - DATA COMPRESSION; MATHEMATICAL TECHNIQUES - ESTIMATION;

FINITE STATE SOURCES; LEMPEL-ZIV ALGORITHM; NUMBER OF STATES ESTIMATION; SOURCE CODING;

CODES, SYMBOLIC;

EID: 0026679656     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.108249     Document Type: Article

References (13)

1. N. Merhav, M. Gutman, and J. Ziv, “On the estimation of the order of a Markov chain and universal data compression,” IEEE Trans. Inform. Theory, vol. 35, 1014–1019, Sept. 1989.
2. J. Ziv and A. Lempel, “Compression of individual sequences via variable rate coding,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 530–536, Sept. 1978.
3. A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” J. Roy. Statist. Soc., vol. 39, no. 1, pp. 1–38, 1977.
4. R. G. Gallager, Information Theory and Reliable Communications. New York: J. Wiley, 1968.
5. I. Csiszar and J. Korner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, 1981.
6. E. Plotnik, M. J. Wienberger, and J. Ziv, “Upper bounds on the probability of sequences emitted by finite-state sources and the redundancy of the Lempel-Ziv algorithm,” submitted to IEEE Trans. Inform. Theory.
7. J. Ziv, “Compression, tests for randomness, and estimating the statistical model of an individual sequence,” in Sequences, R. M. Capocelli, Ed. New York: Springer-Verlag, 1990, pp. 366–373.
8. N. Merhav, “Universal coding with minimum probability of codeword length overflow,” IEEE Trans. Inform. Theory, vol. 37, pt. 1, 556–563, May 1991.
9. G. D. Forney, Jr., “Exponential error bounds for erasure, list, and decision feedback schemes,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 206–220, Mar. 1968.
10. W. B. Davenport, Jr. and W. L. Root, Random Signals and Noise. New York: McGraw-Hill, 1958, pp. 322–324.
11. L. R. Rabiner, “A tutorial on hidden Markov models and selected applications in speech recognition,” Proc. IEEE, vol. 77, pp. 257–286, Feb. 1989.
12. M. J. Weinberger, A. Lempel, and J. Ziv, “A sequential algorithm for the universal coding of finite memory sources,” submitted to IEEE Trans. Inform. Theory.
13. O. Zeitouni, J. Ziv, and N. Merhav, “When is the generalized likelihood ratio test optimal?d submitted to IEEE Trans. Inform. Theory.