New bounds on D-ary optimal codes

Author	dc.contributor.author	Navarro, Gonzalo
Author	dc.contributor.author	Brisaboa, Nieves	es_CL
Admission date	dc.date.accessioned	2007-05-18T15:05:49Z
Available date	dc.date.available	2007-05-18T15:05:49Z
Publication date	dc.date.issued	2005-12-16
Cita de ítem	dc.identifier.citation	INFORMATION PROCESSING LETTERS 96 (5): 178-184 DEC 16 2005	en
Identifier	dc.identifier.issn	0020-0190
Identifier	dc.identifier.uri	https://repositorio.uchile.cl/handle/2250/124598
Abstract	dc.description.abstract	We propose a simple method that, given a symbol distribution, yields upper and lower bounds on the average code length of a D-ary optimal code over that distribution. Thanks to its simplicity, the method permits deriving analytical bounds for families of parametric distributions. We demonstrate this by obtaining new bounds, much better than the existing ones, for Zipf and exponential distributions when D > 2.	en
Lenguage	dc.language.iso	en	en
Publisher	dc.publisher	ELSEVIER	en
Keywords	dc.subject	HUFFMAN CODES	en
Título	dc.title	New bounds on D-ary optimal codes	en
Document type	dc.type	Artículo de revista