dc.contributor.author |
Staiger, L |
en |
dc.date.accessioned |
2009-04-16T23:13:57Z |
en |
dc.date.available |
2009-04-16T23:13:57Z |
en |
dc.date.issued |
2006-05 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-280 (2006) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3787 |
en |
dc.description.abstract |
Kraft’s inequality is a classical theorem in Information Theory which
establishes the existence of prefix codes for certain (admissible) length distributions.
We prove the following generalisation of Kraft’s theorem: For
every admissible infinite length distribution one can construct a maximal
prefix codes whose codewords satisfy this length distribution. |
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 |
On Maximal Prefix Codes |
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 |