Optimum Extendible Prefix Codes
| dc.creator | Calude,Cristian | |
| dc.creator | Tomescu,Ioan | |
| dc.date | 1997 | |
| dc.date.accessioned | 2024-02-06T12:49:07Z | |
| dc.date.available | 2024-02-06T12:49:07Z | |
| dc.description | Suppose that we have L messages coded by a prefix code (over an alphab et M with m letters) having a minimum weighted length. The problem addressed in this paper is the following: How to find s codewords for new messages so that by leaving unchanged the codification of the first L messages (by compatibility rea sons), the resulting extended code is still prefix (over M) and has a minimum weighted length? To this aim we introduce the notion of optimum extendible prefix code and then, by modifying Huffman s algorithm, we give an effcient algorithm to construct the opti mum extension of a non-complete prefix code, provided the initial code is optimal. 1.) Proceedings of the First Japan-New Zealand Workshop on Logic in Computer Science, special issue editors D.S. Bridges, C.S. Calude, M.J. Dinneen and B. Khoussainov. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-003-11-1167 | |
| dc.identifier | https://lib.jucs.org/article/27428/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7250 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 3(11): 1167-1179 | |
| dc.subject | Kraft's inequality | |
| dc.subject | Huffman tree | |
| dc.subject | optimum extendible prefix code | |
| dc.title | Optimum Extendible Prefix Codes | |
| dc.type | Research Article |