메뉴 건너뛰기




Volumn 99, Issue 5, 2006, Pages 175-180

Binary codes for locally homogeneous sequences

Author keywords

Algorithms; Coding; Compression; Elias code; Huffman code; Information retrieval; Locally adaptive code; Minimum redundancy code

Indexed keywords

ALGORITHMS; GLOSSARIES; INFORMATION RETRIEVAL; INTEGER PROGRAMMING;

EID: 33745343747     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.04.014     Document Type: Article
Times cited : (8)

References (11)
  • 1
    • 22044441103 scopus 로고    scopus 로고
    • Inverted index compression using word-aligned binary codes
    • Source code available from
    • Anh V.N., and Moffat A. Inverted index compression using word-aligned binary codes. Information Retrieval 8 1 (2005) 151-166. http://www.cs.mu.oz.au/~alistair/carry/ Source code available from
    • (2005) Information Retrieval , vol.8 , Issue.1 , pp. 151-166
    • Anh, V.N.1    Moffat, A.2
  • 3
    • 0016486577 scopus 로고
    • Universal codeword sets and representations of the integers
    • Elias P. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory IT-21 2 (1975) 194-203
    • (1975) IEEE Transactions on Information Theory , vol.IT-21 , Issue.2 , pp. 194-203
    • Elias, P.1
  • 4
    • 0001137268 scopus 로고    scopus 로고
    • The Burrows-Wheeler transform for block sorting text compression: Principles and improvements
    • Fenwick P. The Burrows-Wheeler transform for block sorting text compression: Principles and improvements. The Computer Journal 39 9 (1996) 731-740
    • (1996) The Computer Journal , vol.39 , Issue.9 , pp. 731-740
    • Fenwick, P.1
  • 5
    • 0037058241 scopus 로고    scopus 로고
    • Burrows-Wheeler compression with variable length integer codes
    • Fenwick P. Burrows-Wheeler compression with variable length integer codes. Software-Practice and Experience 32 13 (2002) 1307-1316
    • (2002) Software-Practice and Experience , vol.32 , Issue.13 , pp. 1307-1316
    • Fenwick, P.1
  • 6
    • 1542622527 scopus 로고
    • Novel compression of sparse bit-strings-Preliminary report
    • Combinatorial Algorithms on Words. Apostolico A., and Galil Z. (Eds), Springer-Verlag, Berlin
    • Fraenkel A.S., and Klein S.T. Novel compression of sparse bit-strings-Preliminary report. In: Apostolico A., and Galil Z. (Eds). Combinatorial Algorithms on Words. NATO ASI Series F vol. 12 (1985), Springer-Verlag, Berlin 169-183
    • (1985) NATO ASI Series F , vol.12 , pp. 169-183
    • Fraenkel, A.S.1    Klein, S.T.2
  • 8
    • 0004990868 scopus 로고    scopus 로고
    • Binary interpolative coding for effective index compression
    • Moffat A., and Stuiver L. Binary interpolative coding for effective index compression. Information Retrieval 3 1 (2000) 25-47
    • (2000) Information Retrieval , vol.3 , Issue.1 , pp. 25-47
    • Moffat, A.1    Stuiver, L.2
  • 9
    • 0018020596 scopus 로고
    • A compression method for clustered bit-vectors
    • Teuhola J. A compression method for clustered bit-vectors. Information Processing Letters 7 6 (1978) 308-311
    • (1978) Information Processing Letters , vol.7 , Issue.6 , pp. 308-311
    • Teuhola, J.1
  • 10
    • 0001104487 scopus 로고    scopus 로고
    • Housekeeping for prefix coding
    • Source code available from
    • Turpin A., and Moffat A. Housekeeping for prefix coding. IEEE Transactions on Communications 48 4 (2000) 622-628. http://www.cs.mu.oz.au/~alistair/mr_coder/ Source code available from
    • (2000) IEEE Transactions on Communications , vol.48 , Issue.4 , pp. 622-628
    • Turpin, A.1    Moffat, A.2


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