On the characterization of statistically synchronizable variable-length codes
From MaRDI portal
Recommendations
- The synchronization of variable-length codes
- The Construction of Variable Length Codes With Good Synchronization Properties
- On the construction of statistically synchronizable codes
- A scheme for the synchronization of variable length codes
- On synchronous variable length coding for discrete noiseless chrannels
- Synchronization recovery of variable-length codes
- On codeword lengths guaranteeing synchronization
- On synchronizable and PSK-synchronizable block codes
- On a class of efficient error-limiting variable-length codes
- scientific article; zbMATH DE number 3659466
Cited in
(16)- Synchronizing codewords of \(q\)-ary Huffman codes
- On the effects of noise and speed on computations
- A scheme for the synchronization of variable length codes
- Černý's conjecture and the road colouring problem
- On codeword lengths guaranteeing synchronization
- Self-synchronizing Huffman codes (Corresp.)
- Shortest Synchronizing Strings for Huffman Codes
- scientific article; zbMATH DE number 3991415 (Why is no real title available?)
- Algorithm for creating (M−1) selfsynchronising M-ary variable length codes
- scientific article; zbMATH DE number 30329 (Why is no real title available?)
- On the construction of statistically synchronizable codes
- The synchronization of variable-length codes
- Optimal synchronous coding
- More on the error recovery for variable-length codes
- Old and new results on alphabetic codes
- Shortest synchronizing strings for Huffman codes
This page was built for publication: On the characterization of statistically synchronizable variable-length codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3804619)