Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet
KI Iwata, M Arimura - IEICE Transactions on Fundamentals of …, 2016 - search.ieice.org
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 …
sources with a finite alphabet is proposed, and an upper bound of the codeword length of …
Lossless compression of grayscale and colour images using multidimensional CSE
D Dubé - 2019 11th International Symposium on Image and …, 2019 - ieeexplore.ieee.org
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 …
technique that is intended for strings of bits. As such, the original version is one-dimensional …
Compression by substring enumeration using sorted contingency tables
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 …
(CSE) with a finite alphabet. In previous studies on CSE, an encoder utilizes inequalities …
Compression by substring enumeration with a finite alphabet using sorting
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 …
(CSE) with a finite alphabet. In previous studies on CSE, an encoder utilizes inequalities …
A Reconstruction of Circular Binary String Using Substrings and Minimal Absent Words
T Ota, A Manada - IEICE Transactions on Fundamentals of …, 2024 - search.ieice.org
A circular string formed by connecting the first and the last symbols of a string is one of the
simplest sequence forms, and it has been used for many applications such as data …
simplest sequence forms, and it has been used for many applications such as data …
Generalization of efficient implementation of compression by substring enumeration
S Sakuma, K Narisawa, A Shinohara - 2016 Data Compression …, 2016 - computer.org
Summary form only given. Compression via Substring Enumeration (CSE) is a lossless
universal data compression scheme, introduced by Dube and Beaudoin [1]. CSE …
universal data compression scheme, introduced by Dube and Beaudoin [1]. CSE …
Two-dimensional source coding by means of subblock enumeration
A technique of lossless compression via substring enumeration (CSE) is a well-known
lossless compression algorithm for a one-dimensional (1D) source. The CSE uses a …
lossless compression algorithm for a one-dimensional (1D) source. The CSE uses a …
A necessary and sufficient condition for reconstruction of circular binary string based on the lengths of substrings with weights
T Ota, A Manada - … Symposium on Information Theory and Its …, 2022 - ieeexplore.ieee.org
A circular string, which is made by connecting the first and the last symbol of a string, is one
of simple sequence forms and is used for many applications such as data compression and …
of simple sequence forms and is used for many applications such as data compression and …
[PDF][PDF] Tilatiivis toteutus tiedon tiivistämiseen osamerkkijonoja luettelemalla
A Hankalahti - 2020 - helda.helsinki.fi
Tutkielmassa käsitellään häviötöntä tiivistysmenetelmää, joka tutkii tiivistettävää dataa, eli
merkkijonoa tai tekstiä, kokonaisuutena, eikä esimerkiksi pieni osa kerrallaan. Menetelmä …
merkkijonoa tai tekstiä, kokonaisuutena, eikä esimerkiksi pieni osa kerrallaan. Menetelmä …
A Universal Two-Dimensional Source Coding by Means of Subblock Enumeration
The technique of lossless compression via substring enumeration (CSE) is a kind of
enumerative code and uses a probabilistic model built from the circular string of an input …
enumerative code and uses a probabilistic model built from the circular string of an input …