메뉴 건너뛰기




Volumn 146, Issue 2, 2005, Pages 180-191

Parallel Lempel Ziv coding

Author keywords

Data compression; Lempel Ziv algorithms; Parallel algorithms

Indexed keywords

BINARY CODES; COMPUTER ARCHITECTURE; DATA COMPRESSION; ENCODING (SYMBOLS); HIERARCHICAL SYSTEMS; PARALLEL ALGORITHMS; STANDARDS; TREES (MATHEMATICS);

EID: 11844269849     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.04.013     Document Type: Conference Paper
Times cited : (38)

References (15)
  • 1
    • 0029217026 scopus 로고
    • Near optimal compression with respect to a static dictionary on a practical massively parallel architecture
    • Snowbird, Utah IEEE Computer Society Press
    • D. Belinskaya, S. De Agostino, J.A. Storer, Near optimal compression with respect to a static dictionary on a practical massively parallel architecture, Proceedings of Data Compression Conference DCC-95, Snowbird, Utah IEEE Computer Society Press, 1995, pp. 172-181.
    • (1995) Proceedings of Data Compression Conference DCC-95 , pp. 172-181
    • Belinskaya, D.1    De Agostino, S.2    Storer, J.A.3
  • 2
    • 77952212644 scopus 로고
    • Parallel algorithms for optimal compression using dictionaries with the prefix property
    • Snowbird, Utah IEEE Computer Society Press
    • S. De Agostino, J.A. Storer, Parallel algorithms for optimal compression using dictionaries with the prefix property, Proceedings of Data Compression Conference DCC-92, Snowbird, Utah IEEE Computer Society Press, 1992, pp. 52-61.
    • (1992) Proceedings of Data Compression Conference DCC-92 , pp. 52-61
    • De Agostino, S.1    Storer, J.A.2
  • 3
    • 0022045174 scopus 로고
    • Parallel algorithms for data compression
    • M.E. Gonzalez Smith, and J.A. Storer Parallel algorithms for data compression J. ACM 32 2 1985 344 373
    • (1985) J. ACM , vol.32 , Issue.2 , pp. 344-373
    • Smith, M.E.G.1    Storer, J.A.2
  • 4
    • 0028056612 scopus 로고
    • Parsing algorithms for dictionary compression on the PRAM
    • Snowbird, Utah IEEE Computer Society Press
    • D.S. Hirschberg, L.M. Stauffer, Parsing algorithms for dictionary compression on the PRAM, Proceedings of Data Compression Conference DCC-94, Snowbird, Utah IEEE Computer Society Press, 1994, pp. 136-145.
    • (1994) Proceedings of Data Compression Conference DCC-94 , pp. 136-145
    • Hirschberg, D.S.1    Stauffer, L.M.2
  • 5
    • 0002667548 scopus 로고
    • Parallel lossless image compression using Huffman and arithmetic coding
    • Snowbird, Utah
    • P.G. Howard, J.S. Vitter, Parallel lossless image compression using Huffman and arithmetic coding, Proceedings of Data Compression Conference DCC-92, Snowbird, Utah, 1992, pp. 299-308.
    • (1992) Proceedings of Data Compression Conference DCC-92 , pp. 299-308
    • Howard, P.G.1    Vitter, J.S.2
  • 6
    • 0032050005 scopus 로고    scopus 로고
    • A simple parallel algorithm for the Ziv-Lempel encoding
    • K. Iwata, M. Morii, T. Uyematsu, and E. Okamoto A simple parallel algorithm for the Ziv-Lempel encoding IEICE Trans. Fund. E81-A 1998 709 712
    • (1998) IEICE Trans. Fund. , vol.81 , pp. 709-712
    • Iwata, K.1    Morii, M.2    Uyematsu, T.3    Okamoto, E.4
  • 7
    • 0042912992 scopus 로고    scopus 로고
    • Parallel Huffman decoding with applications to JPEG files
    • S.T. Klein, and Y. Wiseman Parallel Huffman decoding with applications to JPEG files Comput. J. 46 5 2003 487 497
    • (2003) Comput. J. , vol.46 , Issue.5 , pp. 487-497
    • Klein, S.T.1    Wiseman, Y.2
  • 8
    • 0001579424 scopus 로고
    • Constructing Huffman trees in parallel
    • L.L. Larmore, and T.M. Przytycka Constructing Huffman trees in parallel SIAM J. Comput. 24 6 1995 1163 1169
    • (1995) SIAM J. Comput. , vol.24 , Issue.6 , pp. 1163-1169
    • Larmore, L.L.1    Przytycka, T.M.2
  • 10
    • 0020190931 scopus 로고
    • Data compression via textual substitution
    • J.A. Storer, and T.G. Szymanski Data compression via textual substitution J. ACM 29 1982 928 951
    • (1982) J. ACM , vol.29 , pp. 928-951
    • Storer, J.A.1    Szymanski, T.G.2
  • 11
    • 0021439618 scopus 로고
    • A technique for high-performance data compression
    • T.A. Welch A technique for high-performance data compression IEEE Comput. 17 1984 8 19
    • (1984) IEEE Comput. , vol.17 , pp. 8-19
    • Welch, T.A.1
  • 12
    • 11844284927 scopus 로고
    • Data Compression Apparatus and Method, US Patent 5,126,739
    • D.L. Whiting, G.A. George, G.E. Ivey, Data Compression Apparatus and Method, US Patent 5,126,739, 1992.
    • (1992)
    • Whiting, D.L.1    George, G.A.2    Ivey, G.E.3
  • 13
    • 79959936285 scopus 로고
    • An extremely fast Ziv-Lempel data compression algorithm
    • Snowbird, Utah
    • R.N. Williams, An extremely fast Ziv-Lempel data compression algorithm, Proceedings of Data Compression Conference DCC-91, Snowbird, Utah, 1991, pp. 362-371.
    • (1991) Proceedings of Data Compression Conference DCC-91 , pp. 362-371
    • Williams, R.N.1
  • 14
    • 0017493286 scopus 로고
    • A universal algorithm for seqduential data compression
    • J. Ziv, and A. Lempel A universal algorithm for sequential data compression IEEE Trans. Inform. Theory IT-23 1977 337 343
    • (1977) IEEE Trans. Inform. Theory , vol.23 , pp. 337-343
    • Ziv, J.1    Lempel, A.2
  • 15
    • 0018019231 scopus 로고
    • Compression of individual sequences via variable-rate coding
    • J. Ziv, and A. Lempel Compression of individual sequences via variable-rate coding IEEE Trans. Inform. Theory IT-24 1978 530 536
    • (1978) IEEE Trans. Inform. Theory , vol.24 , pp. 530-536
    • Ziv, J.1    Lempel, A.2


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