A new approach to alphabet extension for improving static compression schemes

Shmuel T. Klein

doi:10.1007/978-3-642-45321-2_10

A new approach to alphabet extension for improving static compression schemes

Shmuel T. Klein

CS@BIU

Research output: Contribution to journal › Article › peer-review

Abstract

The performance of data compression on a large static text may be improved if certain variable-length strings are included in the character set for which a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.

Original language	English
Pages (from-to)	197-212
Number of pages	16
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8001
DOIs	https://doi.org/10.1007/978-3-642-45321-2_10
State	Published - 2014

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2014.

Access to Document

10.1007/978-3-642-45321-2_10

Cite this

@article{be1a695541ed414eabddf295a3603feb,

title = "A new approach to alphabet extension for improving static compression schemes",

abstract = "The performance of data compression on a large static text may be improved if certain variable-length strings are included in the character set for which a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.",

author = "Klein, {Shmuel T.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2014.",

year = "2014",

doi = "10.1007/978-3-642-45321-2_10",

language = "אנגלית",

volume = "8001",

pages = "197--212",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - A new approach to alphabet extension for improving static compression schemes

AU - Klein, Shmuel T.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2014.

PY - 2014

Y1 - 2014

N2 - The performance of data compression on a large static text may be improved if certain variable-length strings are included in the character set for which a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.

AB - The performance of data compression on a large static text may be improved if certain variable-length strings are included in the character set for which a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.

UR - http://www.scopus.com/inward/record.url?scp=84916222584&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-45321-2_10

DO - 10.1007/978-3-642-45321-2_10

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84916222584

SN - 0302-9743

VL - 8001

SP - 197

EP - 212

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

A new approach to alphabet extension for improving static compression schemes

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this