Practical fixed length Lempel-Ziv coding

Authors:
Shmuel T. Klein;Dana Shapira
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 13
Cited 0

Word-based text compression

Software—Practice & Experience
Let sleeping files lie: pattern matching in Z-compressed files

Journal of Computer and System Sciences
Data compression via textual substitution

Journal of the ACM (JACM)
Fast and flexible word searching on compressed text

ACM Transactions on Information Systems (TOIS)
A New Compression Method for Compressed Matching

DCC '00 Proceedings of the Conference on Data Compression
Pattern Matching in LZW Compressed Files

IEEE Transactions on Computers
Pattern matching in Huffman encoded texts

Information Processing and Management: an International Journal
A Technique for High-Performance Data Compression

Computer
An efficient compression code for text databases

ECIR'03 Proceedings of the 25th European conference on IR research
On the Usefulness of Fibonacci Compression Codes

The Computer Journal
On improving Tunstall codes

Information Processing and Management: an International Journal
A universal algorithm for sequential data compression

IEEE Transactions on Information Theory
Compression of individual sequences via variable-rate coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

We explore the possibility of transforming the standard encodings of the main LZ methods to be of fixed length, without reverting to the originally suggested encodings. This has the advantage of allowing easier processing and giving more robustness against errors, while only marginally reducing the compression efficiency in certain cases.