Near Merging of Paths in Suboptimal Tree Searching

Hsueh-Ming Hang, John W. Woods

研究成果: Article同行評審

3 引文 斯高帕斯(Scopus)

摘要

The near merging of paths in tree searching is explored. This near merging can degrade coding performance when a suboptimal search algorithm is used. The problem is first identified and then a feasible solution is presented. Some examples from image source coding using the (M, L) algorithm are given.

原文English
頁(從 - 到)567-573
頁數7
期刊IEEE Transactions on Information Theory
30
發行號3
DOIs
出版狀態Published - 1 一月 1984

指紋 深入研究「Near Merging of Paths in Suboptimal Tree Searching」主題。共同形成了獨特的指紋。

引用此