DocumentCode
1495077
Title
A Kraft-Type Sufficient Condition for the Existence of 
-Ary Fix-Free Codes
Author
Khosravifard, Mohammadali ; Halabian, Hassan ; Gulliver, T. Aaron
Author_Institution
Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran
Volume
56
Issue
6
fYear
2010
fDate
6/1/2010 12:00:00 AM
Firstpage
2920
Lastpage
2927
Abstract
A greedy scheme called Greedy Codeword Assignment Scheme (GCAS) is proposed to assign D-ary codewords to the given code-lengths ¿1,¿2,...,¿n, so that they satisfy the fix-free property. This scheme guarantees that a D-ary fix-free code can be obtained whenever ¿i=1 n D-¿ ¿ ¿(D), where ¿(D) is equal to 5/8 for D even and very close to 5/8 for D odd. This result can be regarded as an extension of Yekhanin´s theorem on the existence of binary fix-free codes. In the special case D=2 , the greediness of GCAS enables us to prove that if mini ¿i = 2, the inequality ¿i=1 n 2-¿ i ¿ 21/32 implies the existence of a binary fix-free code with code-lengths ¿1,¿2,...,¿n.
Keywords
binary codes; D-ary codeword; D-ary fix-free code; Kraft-sum; Kraft-type sufficient condition; Yekhanin theorem; binary fix-free code; code-length; fix-free property; greedy codeword assignment scheme; Binary codes; Helium; Source coding; Sufficient conditions; $D$ -ary fix-free code; ${3over 4}$
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2010.2046244
Filename
5466508
Link To Document