On the Construction of an Antidictionary of a Binary String with Linear Complexity

An antidictionary of a binary string is a set of words of minimal length that never appear in this string. Antidictionaries are in particular useful for source coding. We present a fast and memory-efficient algorithm to construct an antidictionary for a binary string using a suffix tree. It is proved that the complexity of this algorithm is linear in space and time, and its effectiveness is demonstrated by simulation results

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

[2]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[3]  Gonzalo Navarro,et al.  Improved antidictionary based compression , 2002, 12th International Conference of the Chilean Computer Science Society, 2002. Proceedings..

[4]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[5]  Svante Janson,et al.  On the average sequence complexity , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[6]  M. Crochemore,et al.  On-line construction of suffix trees , 2002 .

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

[8]  Wojciech Szpankowski,et al.  A Note on the Height of Suffix Trees , 1992, SIAM J. Comput..

[9]  Hiroyoshi Morita,et al.  A tight upper bound on the size of the antidictionary of a binary string , 2005 .