Shortest Synchronizing Codewords of A Binary Huffman Equivalent Code

Authors:
Yuh-Ming Huang;Sheng-Chi Wu
Affiliations:
-;-
Venue:
ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications
Year:
2003

Citing 0
Cited 3

Shortest Synchronizing Strings for Huffman Codes

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Shortest synchronizing strings for Huffman codes

Theoretical Computer Science
The construction of binary Huffman equivalent codes with a greater number of synchronising codewords

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The inherent problem of a variable-length code is thateven a single bit error can cause loss of synchronization andmay lead to error propagation.Synchronizing codewordshave been extensively studies as a mean to overcome thedrawback and efficiently stop error propagation.In thisextended summary, first we prove the restatement [Theorem2, 13] of a result originally given in [1] in a morestraightforward way.Next, we present the necessaryconditions for the existence of a binary Huffman equivalentcode with shortest synchronizing codeword(s).Finally, withthe help of derived conditional equations, a unified approachfor constructing a binary Huffman equivalent code withmost shortest synchronizing codeword(s) and most othersynchronizing codewords is proposed also.