Error recovery for variable length codes
IEEE Transactions on Information Theory
Reset sequences for monotonic automata
SIAM Journal on Computing
Synchronizing codewords of q-ary Huffman codes
Discrete Mathematics
Synchronizing finite automata on Eulerian digraphs
Theoretical Computer Science - Mathematical foundations of computer science
Shortest Synchronizing Codewords of A Binary Huffman Equivalent Code
ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications
Synchronizing generalized monotonic automata
Theoretical Computer Science - Insightful theory
Synchronizing automata with a letter of deficiency 2
Theoretical Computer Science
An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Construction of minimum-redundance codes with an optimum synchronizing property
IEEE Transactions on Information Theory
Self-synchronizing Huffman codes (Corresp.)
IEEE Transactions on Information Theory
On the construction of statistically synchronizable codes
IEEE Transactions on Information Theory - Part 2
On the characterization of statistically synchronizable variable-length codes
IEEE Transactions on Information Theory
| Hi-index | 5.23 |
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 finding a synchronizing string of some finite automaton. The Cerny conjecture for this class of automata is discussed.