Almost all complete binary prefix codes have a self-synchronizing string

DOI10.1109/TIT.2003.815803zbMath1286.94055OpenAlexW2111454628MaRDI QIDQ3546891

Francois Theberge, Chris Freiling, Kenneth Zeger, Douglas S. Jungreis

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2003.815803

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Related Items (7)

Shortest synchronizing strings for Huffman codes ⋮ Unnamed Item ⋮ A quadratic algorithm for road coloring ⋮ Shortest Synchronizing Strings for Huffman Codes ⋮ Algebraic synchronization criterion and computing reset words ⋮ A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA ⋮ A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata

This page was built for publication: Almost all complete binary prefix codes have a self-synchronizing string