Shortest Synchronizing Strings for Huffman Codes
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science（2008）
摘要
Most complete binary prefix codes have a synchronizing string, that is a string that resynchronizes the decoder regardless
of its previous state. This work presents an upper bound on the length of the shortest synchronizing string for such codes.
Two classes of codes with a long shortest synchronizing string are presented. It is known that finding a synchronizing string
for a code is equivalent to a finding a synchronizing string of some finite automaton. The Černý conjecture for this class
of automata is discussed.
更多查看译文
关键词
huffman codes,finite automaton,synchronizing string,previous state,complete binary prefix code,shortest synchronizing strings,shortest synchronizing string,long shortest,prefix code,upper bound
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要