Efficient Huffman decoder using octal tree search algorithm
Vol. 25, No. 12, pp. 2033-2038, Dec. 2000
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]
우광희, 김구용, 한헌수, 차형태, "Efficient Huffman decoder using octal tree search algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 25, no. 12, pp. 2033-2038, 2000. DOI: .
[ACM Style]
우광희, 김구용, 한헌수, and 차형태. 2000. Efficient Huffman decoder using octal tree search algorithm. The Journal of Korean Institute of Communications and Information Sciences, 25, 12, (2000), 2033-2038. DOI: .
[KICS Style]
우광희, 김구용, 한헌수, 차형태, "Efficient Huffman decoder using octal tree search algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 25, no. 12, pp. 2033-2038, 12. 2000.
pISSN : 1226 - 4717
eISSN : 2287 - 3880