Title :
Sufficient conditions of existence of fix-free codes
Author :
Sergey, Yekhanin
Author_Institution :
Dept. of Comput. Math. & Cybern., Moscow State Univ., Russia
Abstract :
A code is fix-free if no codeword is a prefix or a suffix of any other. In this paper we improve the best-known sufficient conditions on the existence of fix-free codes by a new explicit construction. We also discuss the well-known Kraft-type conjecture on the existence of fix-free codes based on the results obtained by computer checking
Keywords :
binary codes; variable length codes; Kraft-type conjecture; explicit construction; fix-free codes existence; prefix; sufficient conditions; suffix; Sufficient conditions;
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.936147
