Huffman Coding
Published in ACM Computing Surveys • Aug 28, 2019
NobleIDNI8P78W40R87S54
Authors:
Alistair Moffat
Abstract
Huffman’s algorithm for computing minimum-redundancy prefix-free codes has almost legendary status in the computing disciplines. Its elegant blend of simplicity and applicability has made it a favorite example in algorithms courses, and as a result it is perhaps one of the most commonly implemented ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!