Fast enumerative source coding
Boris Ya. Ryabko · 2002
The problem of enumerative coding was considered by Cover (1973) for the first time. By coding words of a length n the method of Cover has an encoding and decoding speed which equals to O(n) when n/spl rarr//spl infin/. We propose a code which has a high speed: O(log/sup 2/nloglogn),n/spl rarr//spl infin/. This code is close to author's (see IEEE Trans. Inf. Theory, vol.30, no.1, p.98, 1994) previous method.