DocumentCode
2945775
Title
On q-ary fix-free codes and directed deBrujin graphs
Author
Deppe, Christian ; Schnettler, Holger
Author_Institution
Dept. of Math., Bielefeld Univ.
fYear
2006
fDate
9-14 July 2006
Firstpage
1482
Lastpage
1485
Abstract
We treat here the question, whether there exists a q-ary fix-free code for a given sequence of codeword lengths. We focus mostly on results which establish the 3/4-conjecture of Ahlswede/Balkenhol/Khachatrian for special classes of lengths sequences. We construct fix-free codes with directed deBrujin graphs. We improve and generalize work of Kukorelly/Zeger and of Yekhanin
Keywords
codes; graph theory; codeword lengths; directed deBrujin graphs; q-ary fix-free codes; Helium; Mathematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.262114
Filename
4036213
Link To Document