An Efficient Decoding Technique for Huffman Code Using Tilted Huffman Trees
Vol. 18, No. 12, pp. 1956-1969, Dec. 1993
Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.
|
Cite this article
[IEEE Style]
김병한 and 임종석, "An Efficient Decoding Technique for Huffman Code Using Tilted Huffman Trees," The Journal of Korean Institute of Communications and Information Sciences, vol. 18, no. 12, pp. 1956-1969, 1993. DOI: .
[ACM Style]
김병한 and 임종석. 1993. An Efficient Decoding Technique for Huffman Code Using Tilted Huffman Trees. The Journal of Korean Institute of Communications and Information Sciences, 18, 12, (1993), 1956-1969. DOI: .
[KICS Style]
김병한 and 임종석, "An Efficient Decoding Technique for Huffman Code Using Tilted Huffman Trees," The Journal of Korean Institute of Communications and Information Sciences, vol. 18, no. 12, pp. 1956-1969, 12. 1993.