DocumentCode
3277903
Title
On the capability of the Harada-Kobayashi algorithm in finding fix-free codewords
Author
Khosravifard, Mohammadali ; Gulliver, T. Aaron
Author_Institution
Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan
fYear
2008
fDate
7-10 Dec. 2008
Firstpage
1
Lastpage
4
Abstract
The capability of the Harada-Kobayashi algorithm in finding fix-free codewords is examined. For n les 30, it is observed that this algorithm finds fix-free codewords for more than 99 percent of codelength vectors with Kraft sum 3/4. Moreover, it will find fix-free codewords for all codelength vectors with Kraft sum 11/16 and n les 30. A simple variation of the Harada-Kobayashi algorithm succeeds in more than 99 percent of its failures.
Keywords
codes; Harada-Kobayashi algorithm; Kraft-type inequality; codelength vector; fix-free codeword finding; Application software; Code standards; Constraint theory; Decoding; Information theory; MPEG 4 Standard; Robustness; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Conference_Location
Auckland
Print_ISBN
978-1-4244-2068-1
Electronic_ISBN
978-1-4244-2069-8
Type
conf
DOI
10.1109/ISITA.2008.4895395
Filename
4895395
Link To Document