Free-Extendible Prefix-Free Sets and an Extension of the Kraft-Chaitin Theorem

Grozea, C

dc.contributor.author	Grozea, C	en
dc.date.accessioned	2009-04-16T23:18:51Z	en
dc.date.available	2009-04-16T23:18:51Z	en
dc.date.issued	1999-07	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-108 (1999)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/3617	en
dc.description.abstract	First, the dual set of a finite prefix-free set is defined. Using this notion we describe equivalent conditions for a finite prefix-free set to be indefinitely extendible. This lead to a simple proof for the Kraft-Chaitin Theorem. Finally, we discuss the influence of the alphabet size on the indefinite extensibility property.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	Free-Extendible Prefix-Free Sets and an Extension of the Kraft-Chaitin Theorem	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en