An efficient compression scheme supporting partial decoding

Yair Kaufman; Shmuel T. Klein

doi:10.1109/dcc.2003.1194052

An efficient compression scheme supporting partial decoding

Yair Kaufman
, Shmuel T. Klein

Department of Computer Science

Bar-Ilan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Proceedings - DCC 2003
Subtitle of host publication	Data Compression Conference
Editors	James A. Storer, Martin Cohn
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	433
Number of pages	1
ISBN (Electronic)	0769518966
DOIs	https://doi.org/10.1109/dcc.2003.1194052
State	Published - 2003
Event	Data Compression Conference, DCC 2003 - Snowbird, United States Duration: 25 Mar 2003 → 27 Mar 2003

Publication series

Name	Data Compression Conference Proceedings
Volume	2003-January
ISSN (Print)	1068-0314

Conference

Conference	Data Compression Conference, DCC 2003
Country/Territory	United States
City	Snowbird
Period	25/03/03 → 27/03/03

Bibliographical note

Publisher Copyright:
© 2003 IEEE.

Keywords

Arithmetic
Computer science
Counting circuits
Databases
Decoding
Huffman coding
Information retrieval
Read-write memory
Tail
Tree data structures

Access to Document

10.1109/dcc.2003.1194052

Cite this

@inproceedings{0923f52d19c34f3f846946033ba45c84,

title = "An efficient compression scheme supporting partial decoding",

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 = "Arithmetic, Computer science, Counting circuits, Databases, Decoding, Huffman coding, Information retrieval, Read-write memory, Tail, Tree data structures",

author = "Yair Kaufman and Klein, \{Shmuel T.\}",

note = "Publisher Copyright: {\textcopyright} 2003 IEEE.; Data Compression Conference, DCC 2003 ; Conference date: 25-03-2003 Through 27-03-2003",

year = "2003",

doi = "10.1109/dcc.2003.1194052",

language = "אנגלית",

series = "Data Compression Conference Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "433",

editor = "Storer, \{James A.\} and Martin Cohn",

booktitle = "Proceedings - DCC 2003",

address = "ארצות הברית",

}

Kaufman, Y & Klein, ST 2003, An efficient compression scheme supporting partial decoding. in JA Storer & M Cohn (eds), Proceedings - DCC 2003: Data Compression Conference., 1194052, Data Compression Conference Proceedings, vol. 2003-January, Institute of Electrical and Electronics Engineers Inc., pp. 433, Data Compression Conference, DCC 2003, Snowbird, United States, 25/03/03. https://doi.org/10.1109/dcc.2003.1194052

An efficient compression scheme supporting partial decoding. / Kaufman, Yair; Klein, Shmuel T.
Proceedings - DCC 2003: Data Compression Conference. ed. / James A. Storer; Martin Cohn. Institute of Electrical and Electronics Engineers Inc., 2003. p. 433 1194052 (Data Compression Conference Proceedings; Vol. 2003-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An efficient compression scheme supporting partial decoding

AU - Kaufman, Yair

AU - Klein, Shmuel T.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - Arithmetic

KW - Computer science

KW - Counting circuits

KW - Databases

KW - Decoding

KW - Huffman coding

KW - Information retrieval

KW - Read-write memory

KW - Tail

KW - Tree data structures

UR - https://www.scopus.com/pages/publications/84942242073

U2 - 10.1109/dcc.2003.1194052

DO - 10.1109/dcc.2003.1194052

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84942242073

T3 - Data Compression Conference Proceedings

SP - 433

BT - Proceedings - DCC 2003

A2 - Storer, James A.

A2 - Cohn, Martin

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - Data Compression Conference, DCC 2003

Y2 - 25 March 2003 through 27 March 2003

ER -

An efficient compression scheme supporting partial decoding

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this