Text Compression Using Antidictionaries

Maxime Crochemore (1) , Filippo Mignosi (2) , Antonio Restivo (2) , Sergio Salemi (2)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 DICGIM - Dipartimento di Ingegneria Chimica, Gestionale, Informatica, Meccanica [Palermo]

We give a new text compression scheme based on Forbidden Words ("antidictionary"). We prove that our algorithms attain the entropy for balanced binary sources. They run in linear time. Moreover, one of the main advantages of this approach is that it produces very fast decompressors. A second advantage is a synchronization property that is helpful to search compressed data and allows parallel compression. Our algorithms can also be presented as "compilers" that create compressors dedicated to any previously fixed source. The techniques used in this paper are from Information Theory and Finite Automata.

Mots clés: data compression; information theory; finite automaton; forbidden word; pattern matching

Domaines: Algorithme et structure de données [cs.DS]

Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi. Text Compression Using Antidictionaries. International Conference on Automata, Languages an Programming (Prague, 1999), 1999, France. pp.261-270, ⟨10.1007/3-540-48523-6_23⟩. ⟨hal-00619991⟩