Relationship between antidictionary automata and compacted substring automata

There are two efficient static data compression algorithms called an antidictionary coding and a lossless data compression via substring enumeration coding. We prove that both of the encoders are isomorphic.

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

[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]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

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

[5]  嶋 優希,et al.  Lossless Data Compression via Substring Enumerationにおけるある改良 , 2011, ISEC 2013.

[6]  Hidetoshi Yokoo,et al.  The universality and linearity of compression by substring enumeration , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.