메뉴 건너뛰기




Volumn 29, Issue 5, 1983, Pages 656-664

A Universal Data Compression System

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

EID: 0020824731     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1983.1056741     Document Type: Article
Times cited : (452)

References (12)
  • 1
    • 0002909927 scopus 로고
    • On entropy maximization principle
    • P. R. Krishnaiah, Ed. Amsterdam: North Holland
    • H. Akaike, “On entropy maximization principle,” in Applications of Statistics, P. R. Krishnaiah, Ed. Amsterdam: North Holland, 1977, pp. 27-41.
    • (1977) Applications of Statistics , pp. 27-41
    • Akaike, H.1
  • 2
    • 84938156629 scopus 로고
    • Comments on ‘Sequence time coding for data compression’
    • Dec.
    • L. D. Davisson, “Comments on ‘Sequence time coding for data compression’,” in Proc. IEEE (Lett.), vol. 54, p. 2010, Dec. 1966.
    • (1966) Proc. IEEE (Lett.) , vol.54 , pp. 2010
    • Davisson, L.D.1
  • 3
    • 0020180461 scopus 로고
    • A simple general binary source code
    • Sept.
    • G. G. Langdon, Jr., and J. Rissanen, “A simple general binary source code,” IEEE Trans. Inform. Theory, vol. IT-28, no. 5, pp. 800-803, Sept. 1982.
    • (1982) IEEE Trans. Inform. Theory , vol.IT-28 , Issue.5 , pp. 800-803
    • Langdon, G.G.1    Rissanen, J.2
  • 4
    • 0017513841 scopus 로고
    • A new universal coding scheme for the binary memoryless source
    • July
    • J. C. Lawrence, “A new universal coding scheme for the binary memoryless source,” IEEE Trans. Inform. Theory, vol. IT-23, no. 4, pp. 466-472, July 1977.
    • (1977) IEEE Trans. Inform. Theory , vol.IT-23 , Issue.4 , pp. 466-472
    • Lawrence, J.C.1
  • 5
    • 0000359937 scopus 로고
    • Sequence time coding for data compression
    • Oct.
    • T. J. Lynch, “Sequence time coding for data compression,” in Proc. IEEE (Lett.), vol. 54, pp. 1490-1491, Oct. 1966.
    • (1966) Proc. IEEE (Lett.) , vol.54 , pp. 1490-1491
    • Lynch, T.J.1
  • 6
    • 67651032689 scopus 로고
    • Ph.D. dissertation, Dept. Electrical and Computer Engineering, University of Massachusetts, Amherst
    • J. S. Ma, “Data compression,” Ph.D. dissertation, Dept. Electrical and Computer Engineering, University of Massachusetts, Amherst, 1978.
    • (1978) Data compression
    • Ma, J.S.1
  • 7
    • 0020102218 scopus 로고
    • Tight lower bounds for optimum code length
    • Mar.
    • J. Rissanen, “Tight lower bounds for optimum code length,” IEEE Trans. Inform. Theory, vol. IT-28, no. 2, pp. 348-349, Mar. 1982.
    • (1982) IEEE Trans. Inform. Theory , vol.IT-28 , Issue.2 , pp. 348-349
    • Rissanen, J.1
  • 8
    • 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
  • 9
    • 0018015137 scopus 로고
    • Modeling by shortest data description
    • J. Rissanen, “Modeling by shortest data description,” Automatica, vol. 14, pp. 465-471, 1978.
    • (1978) Automatica , vol.14 , pp. 465-471
    • Rissanen, J.1
  • 10
    • 0015346058 scopus 로고
    • An algorithm for source coding
    • J. P. M. Schalkwijk, “An algorithm for source coding,” IEEE Trans. Inform. Theory, vol. IT-18, no. 3, pp. 395-398, 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.IT-18 , Issue.3 , pp. 395-398
    • Schalkwijk, J.P.M.1
  • 12
    • 0018019231 scopus 로고
    • Compression if individual sequences via variable-rate-encoding
    • Sept.
    • J. Ziv and A. Lempel, “Compression if individual sequences via variable-rate-encoding,” 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


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