This paper surveys the theoretical literature on fixed-to-variable-length lossless source code
trees, called code trees, and on variable-length-to-fixed lossless source code trees, called …

We consider Markov chains with finite states, which have unique stationary distributions and
satisfy the following conditions I)-III). I) Each state si has its own discrete parameter t i. II) …

We propose almost instantaneous fixed-to-variable length (AIFV) codes such that two (resp.
K-1) code trees are used, if code symbols are binary (resp. K-ary for K≥ 3), and source …

Iwata and Yamamoto proposed an iterative algorithm to obtain the optimal AIFV-m code with
m code trees for a given source probability distribution, which can attain better compression …

For any finite discrete source, the competitive advantage of prefix code over prefix code is
the probability produces a shorter codeword than, minus the probability produces a shorter …

This paper gives a methodology for optimizing AIVF (almost instantaneous variable-to-fixed
length) codes based on two algorithms: The first algorithm is the dynamic programming (DP) …

Variable-to-fixed (VF) codes are often based on dictionaries that obey the prefix-free
property; eg, the Tunstall codes. However, correct VF codes need not be prefix free …

In this paper, K-ary almost instantaneous fixed-to-variable-length (AIFV) codes are proposed
for K≥ 3, and it is shown that the K-ary AIFV codes using K-1 code trees can attain better …

We present Marlin, a variable-to-fixed (VF) codec optimized for decoding speed. Marlin
builds upon a novel way of constructing VF dictionaries that maximizes efficiency for a given …

Almost Instantaneous VF code proposed by Yamamoto and Yokoo in 2001, which is one of
the variable-length-to-fixed-length codes, uses a set of parse trees and achieves a good …