By Topic

On the Use of Stronger Synchronization to Boost Compression by Substring Enumeration

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

A new lossless data compression technique called compression by substring enumeration (CSE) has recently been introduced. CSE is competitive but it achieves lower performance on non-text-like data. More recent work confirmed that CSE incurs a penalty due to the fact that it is unaware of the position (or phase) of the bits relative to the byte boundaries. That work demonstrated that CSE can be boosted by adding a preprocessing step in which synchronization bits are inserted in the data. Various synchronization schemes were used and, in general, it has been observed that the more we insert bits, the more we improve the compression, with the best results obtained using a reliable scheme that inserts 5 bits per byte (n = 13). In this work, the authors measure the boost when using even stronger schemes. The results are negative: the use of stronger schemes (n <; 13) brings only minimal improvements.

Published in:

Data Compression Conference (DCC), 2011

Date of Conference:

29-31 March 2011