Near Merging of Paths in Suboptimal Tree Searching

Hsueh-Ming Hang, John W. Woods

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


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.

Original languageEnglish
Pages (from-to)567-573
Number of pages7
JournalIEEE Transactions on Information Theory
Issue number3
StatePublished - May 1984


Dive into the research topics of 'Near Merging of Paths in Suboptimal Tree Searching'. Together they form a unique fingerprint.

Cite this