Please use this identifier to cite or link to this item: doi:10.22028/D291-26075
Title: An efficient algorithm for constructing nearly optimal prefix codes
Author(s): Mehlhorn, Kurt
Language: English
Year of Publication: 1978
OPUS Source: Saarbrücken, 1978
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: A new algorithm for constructing nearly optimal prefix codes in the case of unequal letter costs and unequal probabilities is presented. A bound on the maximal deviation from the optimum is derived and numerical examples are given. The algorithm has running time O(t·n) where t is the number of letters and n is the number of probabilities.
Link to this record: urn:nbn:de:bsz:291-scidok-40217
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1978/13
Date of registration: 27-Jul-2011
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1978_13.pdf2,52 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.