Synchronization of binary source codes
IEEE Transactions on Information Theory
Synchronizing codewords of q-ary Huffman codes
Discrete Mathematics
Shortest Synchronizing Codewords of A Binary Huffman Equivalent Code
ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
The construction of variable length codes with good synchronization properties
IEEE Transactions on Information Theory
MAP Decoding of Variable Length Codes With Self-Synchronization Strings
IEEE Transactions on Signal Processing
Binary Huffman equivalent codes with a short synchronizing codeword
IEEE Transactions on Information Theory
Synchronization recovery of variable-length codes
IEEE Transactions on Information Theory
Synchronization Recovery and State Model Reduction for Soft Decoding of Variable Length Codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
An inherent problem with a Variable-Length Code (VLC) is that even a single bit error can cause a loss of synchronisation, and thus lead to error propagation. Codeword synchronisation has been extensively studied as a means to overcome this drawback and efficiently stop error propagation. In this paper, we first present the sufficient and necessary conditions for the existence of binary Huffman equivalent codes with the shortest, or at most two shortest, synchronising codeword(s) of length m + 1, where m (>1) is the shortest codeword length. Next, based on the results, we propose a unified approach for constructing each of these binary Huffman equivalent codes with the shortest, or at most two shortest, synchronising codeword(s) of length m + 1, if such a code exists for a given length vector.