메뉴 건너뛰기




Volumn 37, Issue 3, 1991, Pages 721-729

New Asymptotic Bounds and Improvements on The Lempel-Ziv Data Compression Algorithm

Author keywords

asymptotic; compression ratio; data compression; entropy; Lempel Ziv

Indexed keywords

CODES, SYMBOLIC - ENCODING; COMPUTER PROGRAMMING - ALGORITHMS; PROBABILITY; REDUNDANCY;

EID: 0026156853     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.79942     Document Type: Article
Times cited : (22)

References (11)
  • 1
    • 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-23, no. 3, pp. 337–343, May 1977.
    • (1977) IEEE Trans. Inform. Theory , vol.IT-23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.2
  • 2
    • 0021439618 scopus 로고
    • A technique for high performance data compression
    • June
    • T. A. Welch, “A technique for high performance data compression,” IEEE Comput., vol. 17, pp. 8–19, June 1984.
    • (1984) IEEE Comput. , vol.17 , pp. 8-19
    • Welch, T.A.1
  • 3
    • 84938015047 scopus 로고
    • A method for the construction of minimum redundancy codes
    • Sept.
    • D. A. Huffman, “A method for the construction of minimum redundancy codes,” Proc. IRE, vol. 40, pp. 1098–1101, Sept. 1952.
    • (1952) Proc. IRE , vol.40 , pp. 1098-1101
    • Huffman, D.A.1
  • 4
    • 0018032133 scopus 로고
    • Variations on a theme by Huffman
    • Nov.
    • R. G. Gallager, “Variations on a theme by Huffman,” IEEE Trans. Inform. Theory, vol. IT-24, no. 6, pp. 668–674, Nov. 1978.
    • (1978) IEEE Trans. Inform. Theory , vol.IT-24 , Issue.6 , pp. 668-674
    • Gallager, R.G.1
  • 5
    • 0018442815 scopus 로고
    • Arithmetic coding
    • Mar.
    • J. Rissanen and G. G. Langdon, Jr., “Arithmetic coding,” IBM J. Res. Dev., vol. 23, pp. 149–162, Mar. 1979.
    • (1979) IBM J. Res. Dev. , vol.23 , pp. 149-162
    • Rissanen, J.1    Langdon, G.G.2
  • 6
    • 0019477275 scopus 로고
    • Universal modeling and coding
    • Jan.
    • J. Rissanen and G. G. Langdon, Jr., “Universal modeling and coding,” IEEE Trans. Inform. Theory, vol. IT-27, no. 1, pp. 12–23, Jan. 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.IT-27 , Issue.1 , pp. 12-23
    • Rissanen, J.1    Langdon, G.G.2
  • 7
    • 0347494019 scopus 로고
    • Linear algorithm for data compression via string matching
    • Jan.
    • M. Rodeh, V. R. Pratt, and S. Even, “Linear algorithm for data compression via string matching,” J. Assoc. Computing Machinery, vol. 28, pp. 16–24, Jan. 1981.
    • (1981) J. Assoc. Computing Machinery , vol.28 , pp. 16-24
    • Rodeh, M.1    Pratt, V.R.2    Even, S.3
  • 8
    • 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, no. 5, pp. 530–536, Sept. 1978.
    • (1978) IEEE Trans. Inform. Theory , vol.IT-24 , Issue.5 , pp. 530-536
    • Ziv, J.1    Lempel, A.2
  • 9
    • 0024768981 scopus 로고
    • Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
    • Nov.
    • A. D. Wyner and J. Ziv, “Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression,” IEEE Trans. Inform. Theory, vol. 35, no. 6, pp. 1250–1258, Nov. 1989.
    • (1989) IEEE Trans. Inform. Theory , vol.35 , Issue.6 , pp. 1250-1258
    • Wyner, A.D.1    Ziv, J.2
  • 10
    • 84941441155 scopus 로고    scopus 로고
    • Entropy and data compression schemes
    • preprint
    • D. S. Ornstein and B. Weiss, “Entropy and data compression schemes,” preprint.
    • Ornstein, D.S.1    Weiss, B.2
  • 11
    • 84945719243 scopus 로고
    • COMPRESS(1)
    • 4.3 Accel UNIX, May
    • “COMPRESS(1),” Programmer's Ref. Man, 4.3 Accel UNIX, May 1987.
    • (1987) Programmer's Ref. Man


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