Converse coding theorem for identification via general degraded broadcast channels

Converse coding theorem for identification via general degraded broadcast channels
复制标题

通过一般降级广播信道进行识别的逆编码定理

DOI:
10.1109/isit.2003.1228240
复制
发表时间:
2003
期刊:
IEEE International Symposium on Information Theory, 2003. Proceedings.
影响因子:
--
通讯作者:
Y. Oohama
Y. Oohama
中科院分区:
--
文献类型:
--
作者:
Y. Oohama

文献摘要

被引文献

相似文献

本文研究了具有一个输入字母表和两个输出字母表的广播信道的身份识别问题.除了一类退化的结构外,我们不对BC的随机性作任何假设。对于上述一般退化BC,在判别错误概率渐近上界于给定水平的条件下,给出了其判别能力域的一个显式外界.当该水平的值为零时,该外边界与内边界重合,从而建立一般退化BC的容量区域。11.主要结果
We consider the problem of identifi- cation(ID) via broadcast channels(BCs) with one in- put alphabet and two output alphabets. We do not assume any condition for the stochastic property of BCs except for a kind of degraded structure. For the above general degraded BCs, we drive an explicit outer bound of the identification capacity region un- der the criterion that the error probability of iden- tification is asymptotically upper bounded by a pre- scribed level. When the value of this level is zero, this outer bound coincides with the inner bound, thereby establishing the capacity region for general degraded BCs. 11. MAIN RESULT