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

DOI10.1109/TIT.2003.815803MaRDI QIDQ3546891zbMATH OpenOpenAlexFDO

Authors Chris Freiling, François Théberge, 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)

Cited in

(6)

• A quadratic algorithm for road coloring
• A quadratic upper bound on the size of a synchronizing word in one-cluster automata
• Shortest Synchronizing Strings for Huffman Codes
• A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
• Finding short synchronizing words for prefix codes
• Shortest synchronizing strings for Huffman codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546891)