Shortest Synchronizing Strings for Huffman Codes
From MaRDI portal
Recommendations
- Shortest synchronizing strings for Huffman codes
- Synchronizing codewords of \(q\)-ary Huffman codes
- 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
- Binary Huffman equivalent codes with a short synchronizing codeword
Cites work
- Almost all complete binary prefix codes have a self-synchronizing string
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
- Construction of minimum-redundance codes with an optimum synchronizing property
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- On synchronizing prefix codes
- On the characterization of statistically synchronizable variable-length codes
- On the construction of statistically synchronizable codes
- On two Combinatorial Problems Arising from Automata Theory
- Reset Sequences for Monotonic Automata
- Self-synchronizing Huffman codes (Corresp.)
- Synchronizing automata with a letter of deficiency 2
- Synchronizing codewords of \(q\)-ary Huffman codes
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing generalized monotonic automata
Cited in
(4)
This page was built for publication: Shortest Synchronizing Strings for Huffman Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599120)
