On the dynamic construction of an antidictionary with linear complexity

An antidictionary is in particular useful for data compression. Static construction algorithms of antidictionaries with linear complexity have been proposed. However, the construction algorithms do not work in a dynamic manner with linear complexity. In this paper, we propose a dynamic construction algorithm of an antidictionary with linear complexity. The proposed algorithm uses two linear construction algorithms of suffix trees proposed by Weiner and Ukkonen, individually. It is proved that the proposed algorithm works with linear complexity. Moreover, its effectiveness is demonstrated by simulation results.

[1]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[2]  Hiroyoshi Morita,et al.  On the adaptive antidictionary code using minimal forbidden words with constant lengths , 2010, 2010 International Symposium On Information Theory & Its Applications.

[3]  Chiara Epifanio,et al.  A Trie-Based Approach for Compacting Automata , 2004, CPM.

[4]  Jan Holub,et al.  DCA Using Suffix Arrays , 2008, Data Compression Conference (dcc 2008).

[5]  Hiroyoshi Morita,et al.  On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree , 2007, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[6]  Antonio Restivo,et al.  Automata and Forbidden Words , 1998, Inf. Process. Lett..

[7]  Philippe Flajolet,et al.  Analysis of algorithms , 2000, Random Struct. Algorithms.

[8]  A. Restivo,et al.  Data compression using antidictionaries , 2000, Proceedings of the IEEE.

[9]  Hiroyoshi Morita,et al.  Length of minimal forbidden words on a stationary ergodic source , 2009, 2009 IEEE International Symposium on Information Theory.

[10]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[11]  Esko Ukkonen,et al.  On-line construction of suffix trees , 1995, Algorithmica.

[12]  Hiroyoshi Morita,et al.  On-Line Electrocardiogram Lossless Compression Using Antidictionary Codes for a Finite Alphabet , 2010, IEICE Trans. Inf. Syst..