Dynamic Shannon Coding

Simple item page
dc.creatorGagie, Travis
dc.date2005-03-30
dc.date.accessioned2026-07-07T08:17:46Z
dc.date.available2026-07-07T08:17:46Z
dc.descriptionWe present a new algorithm for dynamic prefix-free coding, based on Shannon coding. We give a simple analysis and prove a better upper bound on the length of the encoding produced than the corresponding bound for dynamic Huffman coding. We show how our algorithm can be modified for efficient length-restricted coding, alphabetic coding and coding with unequal letter costs.
dc.description6 pages; conference version presented at ESA 2004; journal version submitted to IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0503085
dc.identifierhttp://arxiv.org/abs/cs/0503085
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134207
dc.subjectInformation Theory
dc.subjectE.4
dc.titleDynamic Shannon Coding
dc.typetext

Files

Collections

arXiv