Please use this identifier to cite or link to this item:
doi:10.22028/D291-26112 | Title: | Codes : unequal probabilities, unequal letter costs |
| Author(s): | Altenkamp, Doris Mehlhorn, Kurt |
| Language: | English |
| Year of Publication: | 1978 |
| OPUS Source: | Saarbrücken, 1978 |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | The construction of alphabetic prefix codes with unequal letter costs and unequal probabilities is considered. A variant of the noiseless coding theorem is proved giving closely matching lower and upper bounds for the cost of the optimal code. Furthermore, an algorithm is described which constructs a nearly optimal code in linear time. |
| Link to this record: | urn:nbn:de:bsz:291-scidok-41512 hdl:20.500.11880/26168 http://dx.doi.org/10.22028/D291-26112 |
| Series name: | Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes |
| Series volume: | 1978/18 |
| Date of registration: | 2-Sep-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 | Size | Format | |
|---|---|---|---|---|
| fb14_1978_18_1.pdf | 4,43 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.