Static Codes

  • Alistair Moffat
  • Andrew Turpin
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 669)


The simplest coding methods are those that ignore or make only minimal use of the supplied probabilities. In doing so, their compression effectiveness may be relatively poor, but the simple and regular codewords that they assign can usually be encoded and decoded extremely quickly. Moreover, some compression applications are such that the source probabilities p i have a distribution to which the regular nature of these non-parameterized codes is well suited.


Binary Code Binary Search Code Algorithm Unary Code Binary Component 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Alistair Moffat
    • 1
  • Andrew Turpin
    • 2
  1. 1.The University of MelbourneAustralia
  2. 2.Curtin University of TechnologyAustralia

Personalised recommendations