The construction of binary Huffman equivalent codes with a greater number of synchronising codewords. (23rd February 2012)

• Record Type: Journal Article
• Authors: Huang, Yuh–Ming; Wu, Sheng–Chi
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 9:Number 1(2012)
• Page Start: 54
• Page End: 65
• Publication Date: 2012-02-23
• Subjects: VLC -- variable–length code -- Huffman code -- Huffman equivalent code -- synchronous code -- synchronising codewords -- ad hoc computing -- ubiquitous computing -- codeword synchronisation; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

Abstract

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.