On the sliding window variations of antidictionary data compression using dynamic suffix trees

Two sliding window variations of an adaptive arithmetic coding method based on dynamic antidictionaries of the input data are proposed. Due to a limited size of sliding window, the proposed methods are memory-efficient and suitable for handling an extremely long string in constant space. Moreover, one of the proposed methods works in linear time with respect to the string length. It is shown that the proposed methods achieve better compression ratios than the traditional compression coding methods by simulation results.