Optimal synchronous coding
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 973791 (Why is no real title available?)
- A Method for the Construction of Minimum-Redundancy Codes
- Binary Huffman equivalent codes with a short synchronizing codeword
- CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES
- Design and analysis of dynamic Huffman codes
- Existence of optimal prefix codes for infinite source alphabets
- Memory efficient and high-speed search Huffman coding
- On breaking a Huffman code
- On synchronizing prefix codes
- On the characterization of statistically synchronizable variable-length codes
- On the synchronizing properties of certain prefix codes
- Self-synchronizing Huffman codes (Corresp.)
- The synchronization of variable-length codes
Cited in
(9)- scientific article; zbMATH DE number 3340923 (Why is no real title available?)
- Sperner codes
- scientific article; zbMATH DE number 1983209 (Why is no real title available?)
- On maximal synchronous codes.
- Synchronizable codes for the optical OPPM channel
- On synchronous variable length coding for discrete noiseless chrannels
- New optimization models for designing synchronizing codes
- Mathematical optimization and the synchronizing properties of encodings
- Uniformly synchronous codes
This page was built for publication: Optimal synchronous coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828660)