Fulltext

Efficient coding of information: Huffman coding

Sridhara, Deepak

In: Resonance, 2006, vol. 11, no. 2, p. 51-73

Ajouter à la liste personnelle
    Titre
    • Efficient coding of information: Huffman coding
    Auteur
    • Sridhara, Deepak. Institut für Mathematik, Universität Zürich, Switzerland
    Type de document
    • Postprint
    Langue
    • Anglais
    Publié dans
    • Resonance, 2006, vol. 11, no. 2, p. 51-73. Springer India
    Autre version électronique
    Identifiant OAI-PMH
    • oai:doc.rero.ch:322426
    Summary
    In his classic paper of 1948, Claude Shannon considered the problem of efficiently describing a source that outputs a sequence of symbols, each associated with a probability of occurrence, and provided the theoretical limits of achievable performance. In 1951, David Huffman presented a technique that attains this performance. This article is a brief overview of some of their results