### Abstract

Original language | English |
---|---|

Pages (from-to) | 65-70 |

Number of pages | 6 |

Journal | Journal of Discrete Algorithms |

Volume | 20 |

Publication status | Published - 2013 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computational Theory and Mathematics
- Discrete Mathematics and Combinatorics

### Cite this

*Journal of Discrete Algorithms*,

*20*, 65-70.

**On parsing optimality for dictionary-based text compression— the Zip case.** / Langiu, Alessio; Langiu, Alessio.

Research output: Contribution to journal › Article

*Journal of Discrete Algorithms*, vol. 20, pp. 65-70.

}

TY - JOUR

T1 - On parsing optimality for dictionary-based text compression— the Zip case

AU - Langiu, Alessio

AU - Langiu, Alessio

PY - 2013

Y1 - 2013

N2 - Dictionary-based compression schemes are the most commonly used data compression schemes since they appeared in the foundational paper of Ziv and Lempel in 1977, and generally referred to as LZ77. Their work is the base of Zip, gZip, 7-Zip and many other compression software utilities. Some of these compression schemes use variants of the greedy approach to parse the text into dictionary phrases; others have left the greedy approach to improve the compression ratio. Recently, two bit-optimal parsing algorithms have been presented filling the gap between theory and best practice. We present a survey on the parsing problem for dictionary-based text compression, identifying noticeable results of both a theoretical and practical nature, which have appeared in the last three decades. We follow the historical steps of the Zip scheme showing how the original optimal parsing problem of finding a parse formed by the minimum number of phrases has been replaced by the bit-optimal parsing problem where the goal is to minimise the length in bits of the encoded text.

AB - Dictionary-based compression schemes are the most commonly used data compression schemes since they appeared in the foundational paper of Ziv and Lempel in 1977, and generally referred to as LZ77. Their work is the base of Zip, gZip, 7-Zip and many other compression software utilities. Some of these compression schemes use variants of the greedy approach to parse the text into dictionary phrases; others have left the greedy approach to improve the compression ratio. Recently, two bit-optimal parsing algorithms have been presented filling the gap between theory and best practice. We present a survey on the parsing problem for dictionary-based text compression, identifying noticeable results of both a theoretical and practical nature, which have appeared in the last three decades. We follow the historical steps of the Zip scheme showing how the original optimal parsing problem of finding a parse formed by the minimum number of phrases has been replaced by the bit-optimal parsing problem where the goal is to minimise the length in bits of the encoded text.

UR - http://hdl.handle.net/10447/86143

M3 - Article

VL - 20

SP - 65

EP - 70

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

SN - 1570-8667

ER -