DocumentCode
3384335
Title
An efficient compression scheme supporting partial decoding
Author
Kaufman, Yair ; Klein, Shmuel T.
Author_Institution
Dept. of Comput. Sci., Bar-Ilan Univ., Ramat-Gan, Israel
fYear
2003
fDate
25-27 March 2003
Firstpage
433
Abstract
Summary form only given. A novel compression method that allows the selective decoding of small portions of the compressed file is described. The method constructs a static context tree, which is used to transform the original input into a more compressible form. However, the RCT algorithm is suggested to split the data into pieces, even quite small ones, without too much affecting the compression ratio.
Keywords
Huffman codes; data compression; decoding; file organisation; tree codes; variable length codes; Huffman code; RCT algorithm; compressed file; compression scheme; context tree; partial decoding; recoding string; selective decoding; Arithmetic; Computer science; Counting circuits; Databases; Decoding; Huffman coding; Information retrieval; Read-write memory; Tail; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2003. Proceedings. DCC 2003
ISSN
1068-0314
Print_ISBN
0-7695-1896-6
Type
conf
DOI
10.1109/DCC.2003.1194052
Filename
1194052
Link To Document