메뉴 건너뛰기




Volumn 44, Issue 2, 1998, Pages 778-781

Simplistic universal coding

Author keywords

Universal coding

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; OPTIMIZATION; SIGNAL DISTORTION;

EID: 0032022698     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.661520     Document Type: Article
Times cited : (14)

References (12)
  • 1
    • 84938156629 scopus 로고
    • Comments on 'Sequence time coding for data compression'
    • L. D. Davisson, "Comments on 'Sequence time coding for data compression'," Proc. IEEE, vol. 54, p. 2010, 1966.
    • (1966) Proc. IEEE , vol.54 , pp. 2010
    • Davisson, L.D.1
  • 2
    • 0015681549 scopus 로고
    • Universal noiseless coding
    • Nov.
    • _, "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
  • 3
    • 0023168253 scopus 로고
    • Interval and recency rank source coding: Two on-line adaptive variable-length schemes
    • Jan.
    • P. Elias, "Interval and recency rank source coding: Two on-line adaptive variable-length schemes," IEEE Trans. Inform. Theory, vol. IT-33, pp. 3-10, Jan. 1987.
    • (1987) IEEE Trans. Inform. Theory , vol.IT-33 , pp. 3-10
    • Elias, P.1
  • 5
    • 0001641786 scopus 로고
    • A generalization of Ornstein's d distance with applications to information theory
    • R. M. Gray, D. L. Neuhoff, and P. C. Shields, "A generalization of Ornstein's d distance with applications to information theory," Ann. Probab., vol. 3, pp. 315-328, 1975.
    • (1975) Ann. Probab. , vol.3 , pp. 315-328
    • Gray, R.M.1    Neuhoff, D.L.2    Shields, P.C.3
  • 6
    • 0000359937 scopus 로고
    • Sequence time coding for data compression
    • T. J. Lynch, "Sequence time coding for data compression," Proc. IEEE, vol. 54, pp. 1490-1491, 1966.
    • (1966) Proc. IEEE , vol.54 , pp. 1490-1491
    • Lynch, T.J.1
  • 7
    • 0027667901 scopus 로고
    • A survey of the theory of source coding
    • J. C. Kieffer, "A survey of the theory of source coding," IEEE Trans. Inform. Theory, vol. 39, pp. 1473-1490, 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 1473-1490
    • Kieffer, J.C.1
  • 8
    • 0016546722 scopus 로고
    • Fixed-rate universal block source coding with a fidelity criterion
    • D. L. Neuhoff, R. M. Gray, and L. D. Davisson, "Fixed-rate universal block source coding with a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-21, pp. 511-523, 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 511-523
    • Neuhoff, D.L.1    Gray, R.M.2    Davisson, L.D.3
  • 9
    • 3142588143 scopus 로고
    • Universal almost sure data compression
    • D. Ornstein and P. Shields, "Universal almost sure data compression," Ann. Probab., vol. 18, pp. 441-452, 1990.
    • (1990) Ann. Probab. , vol.18 , pp. 441-452
    • Ornstein, D.1    Shields, P.2
  • 10
    • 0000486749 scopus 로고
    • How sampling reveals a process
    • D. Ornstein and B. Weiss, "How sampling reveals a process," Ann. Probab., vol. 18, pp. 905-930, 1990.
    • (1990) Ann. Probab. , vol.18 , pp. 905-930
    • Ornstein, D.1    Weiss, B.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
    • 0000607227 scopus 로고
    • Coding of sources with unknown statistics-Part II: Distortion relative to a fidelity criterion
    • May
    • J. Ziv, "Coding of sources with unknown statistics-Part II: Distortion relative to a fidelity criterion," IEEE Trans. Inform. Theory, vol. IT-18, pp. 389-394, May 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.IT-18 , pp. 389-394
    • Ziv, J.1


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