Synchronizing codewords of q-ary Huffman codes
UNSPECIFIED (1999) Synchronizing codewords of q-ary Huffman codes. DISCRETE MATHEMATICS, 198 . pp. 637-655. ISSN 0012-365XFull text not available from this repository.
Some Huffman codes contain a special codeword called a synchronizing codeword, which resynchronizes the code whenever it is transmitted. We demonstrate properties of synchronizing codewords and, in particular, give some relationships between the length of the shortest codeword and the length and structure of the synchronizing codeword. A tight upper bound and some lower bounds are presented. We show that given a shortest codeword of length m and a synchronizing codeword of length r < 2m - 1 then the code also contains other synchronizing codewords. We calculate the number and lengths of these codewords, Finally, several examples of good codes are given. (C) 1999 Elsevier Science B.V. All rights reserved.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics|
|Journal or Publication Title:||DISCRETE MATHEMATICS|
|Publisher:||ELSEVIER SCIENCE BV|
|Date:||28 February 1999|
|Number of Pages:||19|
|Page Range:||pp. 637-655|
Actions (login required)