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 …

A novel loss less compression algorithm known as compression by sub string enumeration
(CSE) is analyzed and modified. The CSE compression algorithm is a block-based, off-line …

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 …

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 …

1 6× 0 2× 1 2 4× 00 2× 01 2× 10 3 3× 000 1× 001 2× 010 1× 100 1× 101 4 2× 0000 1× 0001
1× 0010 1× 0100 1× 0101 1× 1000 1× 1010 5 1× 00000 1× 00001 1× 00010 1× 00101 1× …

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 …

One of the challenges in forming coalitions within characteristic function games is in
determining a suitable strategy for distributing coalition value calculations across a …