動態逼近加權壓縮法：實作與分析

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	蔡其寰	en_US
dc.contributor.author	Chi-Huan Tsai	en_US
dc.contributor.author	蔡錫鈞	en_US
dc.date.accessioned	2014-12-12T03:08:02Z	-
dc.date.available	2014-12-12T03:08:02Z	-
dc.date.issued	2003	en_US
dc.identifier.uri	http://140.113.39.130/cdrfb3/record/nctu/#GT009017598	en_US
dc.identifier.uri	http://hdl.handle.net/11536/81681	-
dc.description.abstract	我們實作並分析了加權二元頻道上的動態壓縮演算法，實驗顯示在一般情況下我們的演算法確實能夠達到接近於理想值的壓縮比。	zh_TW
dc.description.abstract	Abstract In this paper we consider the adaptive case of pre‾x-free coding with unequal letter costs. That is, given an alphabet with size n, and a binary channel with unequal cost digits, we try to construct a pre‾x-free code W adaptively. Our goal is to achieve or approximate minimum-redundancy a tree-based method can generate. Our experimental results show that generally our adaptive algorithms can construct codes with low redundancy. . Key Words: information theory, source coding, unequal cost, adaptive algo- rithm, binary channel.	en_US
dc.language.iso	en_US	en_US
dc.subject	資訊理論	zh_TW
dc.subject	資料壓縮	zh_TW
dc.subject	二元頻道	zh_TW
dc.subject	動態編碼	zh_TW
dc.subject	information theory	en_US
dc.subject	source coding	en_US
dc.subject	data compression	en_US
dc.subject	unequal cost	en_US
dc.subject	binary channel	en_US
dc.subject	adaptive algorithm	en_US
dc.title	動態逼近加權壓縮法：實作與分析	zh_TW
dc.title	Adaptive minimum-redundancy coding over binary channel with unequal cost letters: implementation and analysis	en_US
dc.type	Thesis	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
顯示於類別：	畢業論文

文件中的檔案：

759801.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。