Title :
On efficiency and properties of countable prefix codes
Author :
Levenshtein, Vladimir I.
Author_Institution :
M.V. Keldysh Inst. of Appl. Math., Acad. of Sci., Moscow, Russia
Abstract :
The problem of decreasing the length function of two complete prefix countable codes proposed by Levenshtein (1968) is considered. A new recursive construction is presented which solves this problem in an asymptotic sense. The length function of prefix countable codes having a non-error propagation property is also investigated
Keywords :
codes; code efficiency; code properties; countable prefix codes; decoding; length function reduction; nonerror propagation property; recursive construction;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.935938
