论文部分内容阅读
本文讨论有相关信源的二址信道上迭加复合树码,提出了二种译码方法,分别得到了误差概率上界。证明了当树码尾长趋于无穷时,平均误差概率指数地趋于0。最后比较了二种译法之优劣。
In this paper, we discuss the composite tree codes superimposed on the two channels with related sources, and propose two decoding methods, respectively, and get the upper bound of the error probability. It is proved that the average error probability exponentially tends to zero when the length of tree tail tends to infinity. Finally, the advantages and disadvantages of the two kinds of translation are compared.