In the entropy coding, AIVF (almost instantaneous variable-to-fixed length) codes using
multiple parsing trees can attain a better compression rate than the Tunstall code, which …

This paper presents extended-domain Golomb (XDG) code, an extension of Golomb code
for sparse geometric sources as well as a generalization of extended-domain Golomb-Rice …

When the alphabet of a source is very big, existing universal data compression algorithms
fail to show their expected performances. The purpose of this paper is to provide an efficient …

Combining a note by J. Rissanen (1983) and an idea of enumerative coding, the authors
obtain a new implementation of the Ziv-Lempel incremental parsing algorithm for coding and …

It is shown that the T-complexity can be derived from a differential equation which represents
how average codeword length increases by the T-augmentation. Furthermore, the proposed …

We developed a simple, practical, adaptive data compression algorithm of the LZ78 class.
According to the Lempel-Ziv greedy parsing, a string boundary is not related to the statistical …

T-codes are variable-length self-synchronizing codes introduced by Titchener in 1984. T-
code codewords are constructed recursively from a finite alphabet using an algorithm called …

Almost sure convergence coding theorems of one-shot and multi-shot Tunstall codes are
proved for stationary memoryless sources. Coding theorem of one-shot Tunstall code is …

In this paper, some theorems which give relationships between a sufficient statistic and the
universality of a VV source code are presented. These theorems can be used as a …

Several information theoretic approaches to signature analysis problems in fault-tolerant
computing | IEEE Conference Publication | IEEE Xplore Several information theoretic …