A Space-Efficient Huffman Decoding Algorithm and its Parallelism
碩士 === 國立台灣工業技術學院 === 管理技術研究所 === 85 === This paper first transforms the Huffman treeinto a single--side growing Huffman tree, then presents a memory--efficientdata structure to represent the single--side growing Huffman tree, whichrequires...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
1997
|
Online Access: | http://ndltd.ncl.edu.tw/handle/72819908164921559975 |