메뉴 건너뛰기




Volumn 83, Issue 1, 2002, Pages 1-6

Compror: On-line lossless data compression with a factor oracle

Author keywords

Algorithms; Combinatorial problems; Combinatorics on word; Data compression; Factor oracle; Formal languages; Repetitions; String algorithms; Suffix link

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; FORMAL LANGUAGES;

EID: 0037118753     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00308-8     Document Type: Article
Times cited : (23)

References (11)
  • 3
    • 0001137268 scopus 로고    scopus 로고
    • The Burrows-Wheeler transform for block sorting text compression - Principles and improvements
    • (1996) Comput. J. , vol.39 , Issue.9 , pp. 731-740
    • Fenwick, P.1
  • 5
    • 84938015047 scopus 로고
    • A method for the construction of minimum redundancy codes
    • (1952) Proc. I.R.E. , vol.40 , Issue.9 , pp. 1098-1101
    • Huffman, D.-A.1


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