Faster implementation of canonical minimum redundancy prefix codes

K. L. Chung; J. G. Wu

Faster implementation of canonical minimum redundancy prefix codes

K. L. Chung^*, J. G. Wu

^*此作品的通信作者

研究成果: 雜誌貢獻 › 期刊論文 › 同行評審

1 引文斯高帕斯（Scopus）

摘要

This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.

原文	英語
頁（從 - 到）	341-345
頁數	5
期刊	Journal of Information Science and Engineering
卷	17
發行號	2
出版狀態	已發佈 - 2001 3月
對外發佈	是

ASJC Scopus subject areas

軟體
人機介面
硬體和架構
圖書館與資訊科學
計算機理論與數學

其它文件與鏈接

Link to publication in Scopus

引用此

@article{191d27594b0b4b49880fc4d2b1a8168e,

title = "Faster implementation of canonical minimum redundancy prefix codes",

abstract = "This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.",

keywords = "Algorithm, Canonical Huffman tree, Compression, Data structure, Huffman decoding",

author = "Chung, {K. L.} and Wu, {J. G.}",

year = "2001",

month = mar,

language = "English",

volume = "17",

pages = "341--345",

journal = "Journal of Information Science and Engineering",

issn = "1016-2364",

publisher = "Institute of Information Science",

number = "2",

}

TY - JOUR

T1 - Faster implementation of canonical minimum redundancy prefix codes

AU - Chung, K. L.

AU - Wu, J. G.

PY - 2001/3

Y1 - 2001/3

N2 - This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.

AB - This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.

KW - Algorithm

KW - Canonical Huffman tree

KW - Compression

KW - Data structure

KW - Huffman decoding

UR - http://www.scopus.com/inward/record.url?scp=0035275924&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035275924&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0035275924

SN - 1016-2364

VL - 17

SP - 341

EP - 345

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

IS - 2

ER -

Faster implementation of canonical minimum redundancy prefix codes

摘要

ASJC Scopus subject areas

其它文件與鏈接

指紋

引用此