Efficient coding of information: Huffman coding |
| |
Authors: | Deepak Sridhara |
| |
Affiliation: | (1) Department of Mathematics and Science Programs, Washington State University Vancouver, 14204 NE Salmon Creek Ave, Vancouver, WA 98686, USA;(2) Department of Electrical Engineering, Columbia University, Mail Code 4712, 500 West 120th Street, New York, NY 10027, USA;(3) Division of Systems Neurology and Neuroscience, Department of Neurology and Neuroscience, Weill Cornell Medical College, 1300 York Avenue, New York, NY 10065, USA |
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|