Optimal synchronous coding

DOI10.1080/00207160410001715285zbMath1070.94004OpenAlexW2087065222WikidataQ59204155 ScholiaQ59204155MaRDI QIDQ4828660

Ming Li, Wei-Jia Jia, Dong Yang Long

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

zbMATH Keywords

Huffman codingData compressionmaximal prefix codeand optimal synchronous codesynchronous coding

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Cites Work

• Unnamed Item
• Memory efficient and high-speed search Huffman coding
• CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES
• Self-synchronizing Huffman codes (Corresp.)
• Design and analysis of dynamic Huffman codes
• On the characterization of statistically synchronizable variable-length codes
• The synchronization of variable-length codes
• Existence of optimal prefix codes for infinite source alphabets
• Binary Huffman equivalent codes with a short synchronizing codeword
• On breaking a Huffman code
• A Method for the Construction of Minimum-Redundancy Codes
• On synchronizing prefix codes
• On the synchronizing properties of certain prefix codes