Data compression: methods and theory
Data compression: methods and theory
Text compression
Text algorithms
The data compression book (2nd ed.)
The data compression book (2nd ed.)
Information Processing Letters
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Minimal Forbidden Words and Factor Automata
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Minimal Forbidden Words and Symbolic Dynamics
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Applications of Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
String pattern matching for a deluge survival kit
Handbook of massive data sets
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Computing forbidden words of regular languages
Fundamenta Informaticae - Special issue on computing patterns in strings
Analysis of the Size of Antidictionary in DCA
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Pattern Matching in DCA Coded Text
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Fast Data Compression with Antidictionaries
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Computing forbidden words of regular languages
Fundamenta Informaticae - Computing Patterns in Strings
Fundamenta Informaticae - Computing Patterns in Strings
On the structure of bispecial Sturmian words
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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.