Binary Huffman equivalent codes with a short synchronizing codeword
UNSPECIFIED (1998) Binary Huffman equivalent codes with a short synchronizing codeword. IEEE TRANSACTIONS ON INFORMATION THEORY, 44 (1). pp. 346-351. ISSN 0018-9448Full text not available from this repository.
For a given set of codeword lengths, there are many different optimal variable-length codes, which are all Huffman equivalent codes, Some of these codes may contain a synchronizing codeword which resynchronizes the code whenever it is transmitted, The shorter the synchronizing codeword, the quicker the code will resynchronize. Ferguson and Rabinowitz suggest the problem of finding, for a given set of codeword lengths, the binary Huffman equivalent code with the shortest synchronizing codeword. In this correspondence we consider binary Huffman equivalent codes whose shortest codeword has length m > 1 and which contain a synchronizing codeword of length m + 1, the shortest possible in this case. We provide an algorithm for constructing these codes for a given set of codeword lengths, if such a code exists. We study further properties of these codes and show that when m greater than or equal to 3 the codes contain more than one synchronizing codeword. Finally, we suggest ways of improving the synchronization properties of the codes and provide some example codes.
|Item Type:||Journal Item|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
T Technology > TK Electrical engineering. Electronics Nuclear engineering
|Journal or Publication Title:||IEEE TRANSACTIONS ON INFORMATION THEORY|
|Publisher:||IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC|
|Official Date:||January 1998|
|Number of Pages:||6|
|Page Range:||pp. 346-351|
Actions (login required)