메뉴 건너뛰기




Volumn 36, Issue 2, 1997, Pages 167-179

A locally adaptive data compression strategy for Chinese-English characters

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DESIGN; ENCODING (SYMBOLS); INTERCONNECTION NETWORKS;

EID: 0042764041     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/0164-1212(95)00200-6     Document Type: Article
Times cited : (2)

References (6)
  • 2
  • 3
    • 84938015047 scopus 로고
    • A method for the construction of minimum redundance codes
    • Huffman, D., A Method for the Construction of Minimum Redundance Codes, in Proceedings of IRE, Vol. 40, 1952, pp. 1098-1110.
    • (1952) Proceedings of IRE , vol.40 , pp. 1098-1110
    • Huffman, D.1
  • 4
    • 84987196804 scopus 로고
    • A locally adaptive data compression scheme
    • Ryabko, B. Y., A Locally Adaptive Data Compression Scheme, Communications of the ACM, Vol. 30, No. 9, 792-796 (1987).
    • (1987) Communications of the ACM , vol.30 , Issue.9 , pp. 792-796
    • Ryabko, B.Y.1
  • 5
    • 0021439618 scopus 로고
    • A technique for high-performance data compression
    • Welch, T. A., A Technique for High-Performance Data Compression, Computers, Vol. C-17, No. 6, 8-19 (1984).
    • (1984) Computers , vol.C-17 , Issue.6 , pp. 8-19
    • Welch, T.A.1
  • 6
    • 0017493286 scopus 로고
    • University algorithm for sequential data compression
    • Ziv, J., and Lempel, A. A University Algorithm for Sequential Data Compression, IEEE Trans, on Information Theory, Vol. IT-23, No. 3, 337-343 (1977).
    • (1977) IEEE Trans, on Information Theory , vol.IT-23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.A.2


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