On a two-dimensional antidictionary construction using suffix tries

Antidictionaries are in particular useful for source coding. In one dimension, for an input string, there are fast construction algorithms of an antidictionary in which a suffix tree that stores all the substrings of the string is utilized. However, in two dimension (2D), for an n×n input square or rectangle, there is no fast construction algorithm of an antidictionary except a straight-forward algorithm in O(n8) time. In this paper, we propose a 2D suffix trie which stores all the subrectangles of an input rectangle and present an algorithm to construct a 2D suffix trie in O(n4 log n) time. A 2D suffix trie consists of two suffix tries with suffix links rowwise and columnwise. Moreover, we propose a fast construction algorithm of a two-dimensional antidictionary using a 2D suffix trie in O(n5 log n) time, and their effectivenesses are demonstrated by simulation results.

[1]  Hiroyoshi Morita,et al.  On the dynamic construction of an antidictionary with linear complexity , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[2]  Filippo Mignosi,et al.  Minimal Forbidden Patterns of Multi-Dimensional Shifts , 2005, Int. J. Algebra Comput..

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

[4]  Hiroyoshi Morita,et al.  On a universal antidictionary coding for stationary ergodic sources with finite alphabet , 2014, 2014 International Symposium on Information Theory and its Applications.

[5]  Joong Chae Na,et al.  Linear-Time Construction of Two-Dimensional Suffix Trees , 2011, Algorithmica.

[6]  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..

[7]  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.

[8]  Raffaele Giancarlo.  A Generalization of the Suffix Tree to Square Matrices, with Applications , 1995, SIAM J. Comput..

[9]  Hiroyoshi Morita,et al.  On the On-line Arithmetic Coding Based on Antidictionaries with Linear Complexity , 2007, 2007 IEEE International Symposium on Information Theory.

[10]  김동규,et al.  [서평]「Algorithms on Strings, Trees, and Sequences」 , 2000 .

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

[12]  Hiroyoshi Morita,et al.  On a two-dimensional antidictionary coding , 2014, 2014 International Symposium on Information Theory and its Applications.

[13]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

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