Title :
Fast enumerative source coding
Author_Institution :
Novosibirsk Telecommun. Inst., Russia
Abstract :
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→∞. We propose a code which has a high speed: O(log2 nloglogn),n→∞. This code is close to author´s (see IEEE Trans. Inf. Theory, vol.30, no.1, p.98, 1994) previous method
Keywords :
decoding; source coding; code length; decoding speed; encoding speed; fast enumerative source coding; high speed code; Algorithm design and analysis; Decoding; Encoding; Source coding;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.550382
