Advertisement

Application: binary coding

  • Jean-François Collet
Chapter
Part of the Universitext book series (UTX)

Summary

Binary coding provides yet another example of how entropy may be used to quantify the “complexity” of things. After reviewing the basics of binary coding, we present the fundamental inequalities of Kraft and McMillan, and then in Theorem 8.9 we present the entropic bound for the length of uniquely decipherable codes. We only touch upon the aspects of coding that have to do with entropy; a more comprehensive presentation of coding theory may be found, for instance, in [24].

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Laboratoire J.A. DieudonnéUniversité de Nice Sophia-AntipolisNice Cedex 02France

Personalised recommendations