Synchronizing codewords of \(q\)-ary Huffman codes
From MaRDI portal
Publication:1292868
DOI10.1016/S0012-365X(99)90127-9zbMath0968.94007OpenAlexW4212845268MaRDI QIDQ1292868
A. E. Escott, Stephanie Perkins
Publication date: 29 September 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90127-9
Related Items (3)
Shortest synchronizing strings for Huffman codes ⋮ Shortest Synchronizing Strings for Huffman Codes ⋮ Synchronizing codewords of \(q\)-ary Huffman codes
Cites Work
- Unnamed Item
- Synchronizing codewords of \(q\)-ary Huffman codes
- Self-synchronizing Huffman codes (Corresp.)
- On the characterization of statistically synchronizable variable-length codes
- On the characterization of statistically synchronizable codes (Corresp.)
- On the construction of statistically synchronizable codes
- Binary Huffman equivalent codes with a short synchronizing codeword
- A Method for the Construction of Minimum-Redundancy Codes
- Codes with bounded synchronization delay
- Construction of minimum-redundance codes with an optimum synchronizing property
This page was built for publication: Synchronizing codewords of \(q\)-ary Huffman codes
