Prague Stringology Conference 2016

Igor O. Zavadskyi and Anatoly V. Anisimov

A Family of Data Compression Codes with Multiple Delimiters

A new family of perspective variable length self-synchronazable binary codes with multiple pattern delimiters is introduced. Each delimiter consists of a run of consecutive ones surrounded by zero brackets. These codes are complete and universal. A simple bijective correspondence between natural numbers and any multi-delimiter code set is established. A fast byte aligned decoding algorithm is constructed. Comparisons of text compression rate and decoding speed for different multi-delimiter codes, the Fibonacci code Fib3 and (s,c)-dense codes are also presented.

Download article: Article in PostScript Article in PDF BibTeX Reference
 PostScript   PDF   BibTeX reference 
Download presentation: Presentation