메뉴 건너뛰기




Volumn 38, Issue 2, 1992, Pages 380-385

On the Optimal Asymptotic Performance of Universal Ordering and of Discrimination of Individual Sequences

Author keywords

data compression; discrimination; finite state sources; Universal ordering

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; INFORMATION THEORY - DATA COMPRESSION; SIGNAL DETECTION;

EID: 0026839128     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.119694     Document Type: Article
Times cited : (11)

References (11)
  • 1
    • 33747472001 scopus 로고
    • Universal decoding for finite-state channels
    • July
    • J. Ziv, “Universal decoding for finite-state channels,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 453–460, July 1985.
    • (1985) IEEE Trans. Inform. Theory , vol.IT-31 , pp. 453-460
    • Ziv, J.1
  • 2
    • 0018019231 scopus 로고
    • Compression of individual sequences via variable rate coding
    • Sept.
    • 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.
    • (1978) IEEE Trans. Inform. Theory , vol.IT-24 , pp. 530-536
    • Ziv, J.1    Lempel, A.2
  • 3
    • 84945714006 scopus 로고
    • AT&T Bell Labs. tech. memo.
    • T. T. Kadota and J. Ziv, AT&T Bell Labs. tech. memo., 1990.
    • (1990)
    • Kadota, T.T.1    Ziv, J.2
  • 4
    • 0022754340 scopus 로고
    • Complexity of strings in the class of Markov sources
    • July
    • J. Rissanen, “Complexity of strings in the class of Markov sources,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 526–532, July 1986.
    • (1986) IEEE Trans. Inform. Theory , vol.IT-32 , pp. 526-532
    • Rissanen, J.1
  • 5
    • 0020721990 scopus 로고
    • Minimax noiseless universal coding for Markov sources
    • Mar.
    • L. D. Davisson, “Minimax noiseless universal coding for Markov sources,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 211–215, Mar. 1983.
    • (1983) IEEE Trans. Inform. Theory , vol.IT-29 , pp. 211-215
    • Davisson, L.D.1
  • 6
    • 84941433176 scopus 로고    scopus 로고
    • A sequential algorithm for the universal coding of finite-memory sources
    • M. J. Weinberger, A. Lempel, and J. Ziv, “A sequential algorithm for the universal coding of finite-memory sources,” to appear in IEEE Trans. Inform. Theory.
    • IEEE Trans. Inform. Theory
    • Weinberger, M.J.1    Lempel, A.2    Ziv, J.3
  • 7
    • 0026679656 scopus 로고
    • Estimating the number of states of a finite-state source
    • Jan.
    • J. Ziv and N. Merhav, “Estimating the number of states of a finite-state source,” IEEE Trans. Inform. Theory, vol. 38, pp. 61–65, Jan. 1992.
    • (1992) IEEE Trans. Inform. Theory , vol.38 , pp. 61-65
    • Ziv, J.1    Merhav, N.2
  • 8
    • 0016486577 scopus 로고
    • Universal codeword sets and representation of the integers
    • Mar.
    • P. Elias, “Universal codeword sets and representation of the integers,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 194–203, Mar. 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 194-203
    • Elias, P.1
  • 9
    • 84945711881 scopus 로고
    • Fixed-prefix encoding
    • July
    • M. Gutman, “Fixed-prefix encoding,” IEEE Trans. Inform. Theory, vol. 36, pp. 401–408, July 1990.
    • (1990) IEEE Trans. Inform. Theory , vol.36 , pp. 401-408
    • Gutman, M.1
  • 10
    • 0024627211 scopus 로고
    • Asymptotically optimal classification for multiple tests with empirically observed statistics
    • Mar.
    • M. Gutman, “Asymptotically optimal classification for multiple tests with empirically observed statistics,” IEEE Trans. Inform. Theory, vol. 35, pp. 401–408, Mar. 1989.
    • (1989) IEEE Trans. Inform. Theory , vol.35 , pp. 401-408
    • Gutman, M.1
  • 11
    • 0004241487 scopus 로고
    • Infinite Sequences and Series
    • New York: Dover Publications Inc.
    • K. Knopp, Infinite Sequences and Series. New York: Dover Publications Inc., 1956.
    • (1956)
    • Knopp, K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.