This paper shows that a two-pass universal antidictionary coding method is asymptotically
optimal for stationary ergodic sources with a finite alphabet. To prove the results, we …

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 …

This paper gives an array-based practical encoder for the lossless data compression
algorithm known as Compression by Substring Enumeration (CSE). The encoder makes use …

A generalization of compression via substring enumeration (CSE) for k-th order Markov
sources with a finite alphabet is proposed, and an upper bound of the codeword length of …

Abstract Compression by Substring Enumeration (CSE) is a recent and promising lossless
compression scheme. The first experiments on CSE showed that it yields compression ratios …

A new lossless data compression technique called compression by substring enumeration
(CSE) has recently been introduced. Two conjectures have been stated in the original paper …

In both theoretical analysis and practical use for an antidictionary coding algorithm, an
important problem is how to encode an antidictionary of an input source. This paper …

Originally, compression by substring enumeration (CSE) is a lossless compression
technique that is intended for strings of bits. As such, the original version is one-dimensional …

Dubé and Beaudoin proposed a new technique of lossless data compression called
compression via substring enumeration (CSE) in 2010. We present an upper bound of the …

This paper proposes two variants of improved Compression by Substring Enumeration
(CSE) with a finite alphabet. In previous studies on CSE, an encoder utilizes inequalities …