Fast Codes for Large Alphabets

Simple item page
dc.creatorRyabko, Boris
dc.creatorAstola, Jaakko
dc.creatorEgiazarian, Karen
dc.date2005-04-03
dc.date.accessioned2026-07-07T08:15:24Z
dc.date.available2026-07-07T08:15:24Z
dc.descriptionWe address the problem of constructing a fast lossless code in the case when the source alphabet is large. The main idea of the new scheme may be described as follows. We group letters with small probabilities in subsets (acting as super letters) and use time consuming coding for these subsets only, whereas letters in the subsets have the same code length and therefore can be coded fast. The described scheme can be applied to sources with known and unknown statistics.
dc.descriptionpublished
dc.identifierhttps://arxiv.org/abs/cs/0504005
dc.identifierhttp://arxiv.org/abs/cs/0504005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133434
dc.subjectInformation Theory
dc.titleFast Codes for Large Alphabets
dc.typetext

Files

Collections

arXiv