The Simplest Coding Problem

  • Imre Csiszár
Part of the International Centre for Mechanical Sciences book series (CISM, volume 136)


Let X be a (finite or countably infinite) set, let Y be a finite set consisting of d elements, let Y* denote the set of all finite sequences (strings) of letters of the alphabet Y (elements of the set Y). Let g=X→Y* be an encoding of elements of X by (variable-length) code-words, having the prefix property.


Shannon Entropy Average Cost Code Word Finite Sequence Entropy Rate 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Wien 1972

Authors and Affiliations

  • Imre Csiszár
    • 1
  1. 1.Hungarian Academy of SciencesBudapest

Personalised recommendations