The minimum achievable redundancy rate of fixed-to-fixed length source codes for general sources
M Arimura, K Iwata - … Symposium On Information Theory & Its …, 2010 - ieeexplore.ieee.org
This paper investigates the minimum achievable redundancy rate of fixed-to-fixed length
lossless source codes (FF codes) for general sources. This paper defines the redundancy …
lossless source codes (FF codes) for general sources. This paper defines the redundancy …
A Study on the Overflow Probability of Variable-to-Fixed Length Codes
S Kuzuoka - … Symposium on Information Theory and Its …, 2020 - ieeexplore.ieee.org
The overflow probability (ie, the probability that the empirical compression rate exceeds a
given threshold) of variable-to-fixed length codes is studied. Particularly,(i) the optimum …
given threshold) of variable-to-fixed length codes is studied. Particularly,(i) the optimum …
On variable-to-fixed length coding of a general source with infinite alphabet
M Arimura, K Iwata - … Symposium on Information Theory and its …, 2012 - ieeexplore.ieee.org
A converse coding theorem for a variable-to-fixed length (VF) source code is proved for a
general source with count-ably infinite alphabet. In this result, redundancy is defined by the …
general source with count-ably infinite alphabet. In this result, redundancy is defined by the …