On antidictionary coding based on compacted substring automaton

Lossless data compression via substring enumeration (CSE) has been proposed by Dubé and Beaudoin in 2010. The CSE outputs its encoder called compacted substring automaton as a codeword, and an efficient representation of the automaton is also proposed. In this paper, we prove an isomorphism between compacted substring automaton and antidictionary automaton, which is an encoder of antidictionary coding. Then we propose a new static antidictionary coding which uses the representation of compacted substring automaton instead of antidictionary. Moreover, we prove an asymptotic optimality of the proposed coding for a stationary ergodic source.