Optimal synchronous coding
DOI10.1080/00207160410001715285zbMATH Open1070.94004OpenAlexW2087065222WikidataQ59204155 ScholiaQ59204155MaRDI QIDQ4828660FDOQ4828660
Authors: Ming Li, Dong-Yang Long, Weijia Jia 
Publication date: 26 November 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160410001715285
Recommendations
Data encryption (aspects in computer science) (68P25) Source coding (94A29) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Memory efficient and high-speed search Huffman coding
- A Method for the Construction of Minimum-Redundancy Codes
- Self-synchronizing Huffman codes (Corresp.)
- Design and analysis of dynamic Huffman codes
- On the synchronizing properties of certain prefix codes
- Existence of optimal prefix codes for infinite source alphabets
- On the characterization of statistically synchronizable variable-length codes
- Binary Huffman equivalent codes with a short synchronizing codeword
- On synchronizing prefix codes
- The synchronization of variable-length codes
- CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES
- On breaking a Huffman code
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Sperner codes
- Title not available (Why is that?)
- 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)
