메뉴 건너뛰기




Volumn E79-A, Issue 5, 1996, Pages 681-686

Data compression by context sorting

Author keywords

Context sorting; Data compression; Rank coding; Universal coding

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA STRUCTURES; ENCODING (SYMBOLS); MARKOV PROCESSES; MATHEMATICAL MODELS; PERFORMANCE; SORTING;

EID: 0030146082     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (3)

References (11)
  • 1
    • 0022902397 scopus 로고
    • Better OPM/L text compression
    • Dec.
    • T.C. Bell, "Better OPM/L text compression," IEEE Trans. Commun., vol.COM-34, no.12, pp.1176-1182, Dec. 1986.
    • (1986) IEEE Trans. Commun. , vol.COM-34 , Issue.12 , pp. 1176-1182
    • Bell, T.C.1
  • 3
    • 0022698885 scopus 로고
    • A locally adaptive data compression scheme
    • April
    • J.L. Bentley, D.D. Sleater, R.E. TarJan, and V.K. Wei, "A locally adaptive data compression scheme," Commun. ACM, vol.29, no.4, pp.320-330, April 1986.
    • (1986) Commun. ACM , vol.29 , Issue.4 , pp. 320-330
    • Bentley, J.L.1    Sleater, D.D.2    Tarjan, R.E.3    Wei, V.K.4
  • 4
    • 0003291859 scopus 로고
    • A block-sorting lossless data compression algorithm
    • May
    • M. Burrows and D.J. Wheeler, "A block-sorting lossless data compression algorithm," SRC Research Report, 124, May 1994.
    • (1994) SRC Research Report , vol.124
    • Burrows, M.1    Wheeler, D.J.2
  • 5
    • 0021405335 scopus 로고
    • Data compression using adaptive coding and partial string matching
    • April
    • J.G. Cleary and I.H. Witten, "Data compression using adaptive coding and partial string matching," IEEE Trans. Commun., vol.COM-32, no.4, pp.396-402, April 1984.
    • (1984) IEEE Trans. Commun. , vol.COM-32 , Issue.4 , pp. 396-402
    • Cleary, J.G.1    Witten, I.H.2
  • 6
    • 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. Inf. Theory, vol. IT-33, no.1, pp.3-10, Jan. 1987.
    • (1987) IEEE Trans. Inf. Theory , vol.IT-33 , Issue.1 , pp. 3-10
    • Elias, P.1
  • 7
    • 0018032133 scopus 로고
    • Variations on a theme by Huffman
    • Nov.
    • R.G. Gallager, "Variations on a theme by Huffman," IEEE Trans. Inf. Theory, vol. IT-24, no.6, pp.668-674, Nov. 1978.
    • (1978) IEEE Trans. Inf. Theory , vol.IT-24 , Issue.6 , pp. 668-674
    • Gallager, R.G.1
  • 8
    • 0024064121 scopus 로고
    • Application of splay trees to data compression
    • Aug.
    • D.W. Jones, "Application of splay trees to data compression," Commun. ACM, vol.31, no.8, pp.996-1007, Aug. 1988.
    • (1988) Commun. ACM , vol.31 , Issue.8 , pp. 996-1007
    • Jones, D.W.1
  • 9
    • 0001492890 scopus 로고
    • Dynamic Huffman coding
    • June
    • D.E. Knuth, "Dynamic Huffman coding," J. Algorithms, vol.6, no.2, pp.163-180, June 1985.
    • (1985) J. Algorithms , vol.6 , Issue.2 , pp. 163-180
    • Knuth, D.E.1
  • 10
    • 0042446055 scopus 로고
    • A study on block-sorting data compression
    • March
    • J.H. Park and H. Imai, "A study on block-sorting data compression," Technical Report of IEICE, vol.94, no.544, pp. 43-48, March 1995.
    • (1995) Technical Report of IEICE , vol.94 , Issue.544 , pp. 43-48
    • Park, J.H.1    Imai, H.2
  • 11
    • 33746850196 scopus 로고
    • Text compression by context sorting
    • May
    • M. Takahashi and H. Yokoo, "Text compression by context sorting," Technical Report of IEICE, vol.95, no.79, pp.7-12, May 1995.
    • (1995) Technical Report of IEICE , vol.95 , Issue.79 , pp. 7-12
    • Takahashi, M.1    Yokoo, H.2


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