UNSPECIFIED (1999) Synchronizing codewords of q-ary Huffman codes. DISCRETE MATHEMATICS, 198 . pp. 637-655. ISSN 0012-365X

Full text not available from this repository.

Abstract

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
ISSN:	0012-365X
Date:	28 February 1999
Volume:	198
Number of Pages:	19
Page Range:	pp. 637-655
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/14849

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item