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...
详细信息
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.
The inherent problem of a variable-length code is that even a single bit error can cause loss of synchronization and may lead to error propagation. Synchronizing codewords have been extensively studies as a mean to ov...
详细信息
ISBN:
(纸本)0769519164
The inherent problem of a variable-length code is that even a single bit error can cause loss of synchronization and may lead to error propagation. Synchronizing codewords have been extensively studies as a mean to overcome the drawback and efficiently stop error propagation. In this extended summary, first we prove the restatement [Theorem 2, 13] of a result originally given in [1] in a more straightforward way. Next, we present the necessary conditions for the existence of a binary Huffman equivalent code with shortest synchronizing codeword(s). Finally, with the help of derived conditional equations, a unified approach for constructing a binary Huffman equivalent code with most shortest synchronizing codeword(s) and most other synchronizing codewords is proposed also.
Novel synchronous coding schemes are introduced and relationships between optimal synchronous codes and Huffman codes are also discussed. Although the problem of existence of optimal synchronous codes has not been res...
详细信息
ISBN:
(纸本)0769515061;076951507X
Novel synchronous coding schemes are introduced and relationships between optimal synchronous codes and Huffman codes are also discussed. Although the problem of existence of optimal synchronous codes has not been resolved yet, we show that any synchronous code can consider as an optimal synchronous code for some information source and that there always exist optimal synchronous codes for the information source with a dyadic probability, distribution. Comparing with Huffman coding, the synchronous coding is used not only for statistical modeling but also for dictionary methods. Moreover, it is proven that breaking a synchronous code is NP-complete.
暂无评论