메뉴 건너뛰기




Volumn 43, Issue 6, 1997, Pages 1966-1976

On fixed-database universal data compression with limited memory

Author keywords

Information theory; Source coding; Universal data compression

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; ENCODING (SYMBOLS); INFORMATION THEORY;

EID: 0031273616     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.641559     Document Type: Article
Times cited : (10)

References (13)
  • 2
    • 0024768981 scopus 로고
    • Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
    • Nov.
    • _, "Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression," IEEE Trans. Inform. Theory, vol. 135, pp. 1250-1258, Nov. 1989.
    • (1989) IEEE Trans. Inform. Theory , vol.135 , pp. 1250-1258
  • 6
    • 0018845233 scopus 로고
    • Lower bound for constant weight codes
    • Jan. Theorem 7
    • R. L. Graham and N. J. A. Sloane, "Lower bound for constant weight codes," IEEE Trans. Inform. Theory, vol. IT-26, pp. 37-43 Jan. 1980, Theorem 7.
    • (1980) IEEE Trans. Inform. Theory , vol.IT-26 , pp. 37-43
    • Graham, R.L.1    Sloane, N.J.A.2
  • 7
    • 0015681549 scopus 로고
    • Universal noiseless coding
    • Nov.
    • L. D. Davisson, "Universal noiseless coding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-795, Nov. 1973.
    • (1973) IEEE Trans. Inform. Theory , vol.IT-19 , pp. 783-795
    • Davisson, L.D.1
  • 8
    • 0020721990 scopus 로고
    • Minimax noiseless universal coding for Markov sources
    • Mar.
    • _, "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
  • 9
    • 0017493286 scopus 로고
    • A universal algorithm for sequential data compression
    • May
    • J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-24, pp. 337-343, May 1977.
    • (1977) IEEE Trans. Inform. Theory , vol.IT-24 , pp. 337-343
    • Ziv, J.1    Lempel, A.2
  • 10
    • 0026157964 scopus 로고
    • Fixed data base version of the Lempel-Ziv data compression algorithm
    • May
    • A. D. Wyner and J. Ziv, "Fixed data base version of the Lempel-Ziv data compression algorithm," IEEE Trans. Inform. Theory, vol. 37, pp. 878-880, May 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 878-880
    • Wyner, A.D.1    Ziv, J.2
  • 11
    • 34250895687 scopus 로고
    • Universal data compression and repetition times
    • Jan.
    • F. M. J. Willems, "Universal data compression and repetition times," IEEE Trans. Inform. Theory, vol. 35, pp. 54-58, Jan. 1989.
    • (1989) IEEE Trans. Inform. Theory , vol.35 , pp. 54-58
    • Willems, F.M.J.1
  • 12
    • 34648830731 scopus 로고    scopus 로고
    • On sliding-window universal data compression with limited-memory
    • Jan.
    • Y. Hershkovits and J. Ziv, "On sliding-window universal data compression with limited-memory," submitted for publication to IEEE Trans. Inform. Theory, Jan. 1996.
    • (1996) IEEE Trans. Inform. Theory
    • Hershkovits, Y.1    Ziv, J.2
  • 13
    • 34648833891 scopus 로고    scopus 로고
    • Inequalities and algorithms for universal data compression
    • a special issue dedicated to Mark Pinsker on his 70th birthday, to be published
    • J. Ziv, "Inequalities and algorithms for universal data compression," Probl. Inform. Transm., 1996, a special issue dedicated to Mark Pinsker on his 70th birthday, to be published.
    • (1996) Probl. Inform. Transm.
    • Ziv, J.1


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