This paper presents a new decoding algorithm of unequal error protection (UEP) code, which is called tree topology.
提出一种新的不等保护分组码译码算法——树状图算法。
Secondly every Huffman tree must have following structure code, data, weight, parent, l-child and r-child but only code and data are needed in decoding .
而且每棵哈夫曼树都必须有以下结构:编码,信息,频度,双亲,左孩子,右孩子。
Secondly every Huffman tree must have following structure code, data, weight, parent, l-child and r-child but only code and data are needed in decoding .
而且每棵哈夫曼树都必须有以下结构:编码,信息,频度,双亲,左孩子,右孩子。
应用推荐