Advertisement

Optimum ’1’ — Ended binary prefix codes

  • Toby Berger
  • Raymond Yeung
Variable Length Coding
Part of the Lecture Notes in Computer Science book series (LNCS, volume 311)

Abstract

We have investigated the problem of finding a binary prefix code of minimum average code word length for a given finite probability distribution subject to the requirement that each code word must end with a ’1’. We give lower and upper bounds to the performance of the optimum code for any information source; the lower bound is tight in some cases. We also describe an algorithm that generates an optimum code for any information source.

Keywords

Terminal Node Code Word Optimum Code Potential Classis Huffman Code 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Toby Berger
    • 1
  • Raymond Yeung
    • 1
  1. 1.Departement Systemes et Communications CNRS, UA 820Ecole Nationale Superieure des Telecommunications (ENST)Paris Cedex 13France

Personalised recommendations