Header

UZH-Logo

Maintenance Infos

Efficient coding of information: Huffman coding


Sridhara, Deepak (2006). Efficient coding of information: Huffman coding. Resonance, 11(2):51-73.

Abstract

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

Abstract

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

Statistics

Citations

Dimensions.ai Metrics

Altmetrics

Downloads

19 downloads since deposited on 02 Nov 2018
13 downloads since 12 months
Detailed statistics

Additional indexing

Contributors:0973-712X
Item Type:Journal Article, refereed, original work
Communities & Collections:National licences > 142-005
Dewey Decimal Classification:Unspecified
Language:English
Date:1 February 2006
Deposited On:02 Nov 2018 07:32
Last Modified:31 Jul 2020 02:31
Publisher:Springer
ISSN:0971-8044
OA Status:Green
Free access at:Publisher DOI. An embargo period may apply.
Publisher DOI:https://doi.org/10.1007/bf02837275
Related URLs:https://www.swissbib.ch/Search/Results?lookfor=nationallicencespringer101007BF02837275 (Library Catalogue)

Download

Green Open Access

Download PDF  'Efficient coding of information: Huffman coding'.
Preview
Content: Published Version
Language: English
Filetype: PDF (Nationallizenz 142-005)
Size: 1MB
View at publisher