NEW RESULTS IN THE THEORY OF IDENTIFICATION VIA CHANNELS
NEW RESULTS IN THE THEORY OF IDENTIFICATION VIA CHANNELS
复制标题
DOI：
10.1109/18.108245
复制
发表时间：
1992-01-01
影响因子：
2.5
通讯作者：
VERDU, S
中科院分区：
文献类型：
--
作者：
HAN, TS;VERDU, S
识别能力是消息数除以块长度的最大迭代对数，当接收方只对确定特定消息是否被传输感兴趣时，块长度可以可靠地传输。对于单用户离散无记忆信道，Ahlswede和Dueck的识别编码定理表明，该信道的识别容量等于Shannon容量。提出了一种证明识别编码定理逆的新方法，实现了结果的强版本。识别加传输（IT）编码是通过信道识别的原始问题的一种变体，它是在点对多点通信中的一个常见问题的背景下提出的，其中中央站希望将信息可靠地传输到N个终端中的一个，其身份不是预先确定的。我们证明，只要（log log N）小于要传输的比特数，IT码就允许以信道容量传输信息。
The identification capacity is the maximal iterated logarithm of the number of messages divided by the blocklength that can be reliably transmitted when the receiver is only interested in deciding whether a specific message was transmitted or not. The identification coding theorem of Ahlswede and Dueck for single-user discrete memoryless channels states that the identification capacity is equal to the Shannon capacity. A new method to prove the converse to the identification coding theorem is shown to achieve the strong version of the result. Identification plus transmission (IT) coding, a variant of the original problem of identification via channels, is proposed in the context of a common problem in Point-to-multipoint communication, where a central station wishes to transmit information reliably to one of N terminals, whose identity is not predetermined. We show that as long as log log N is smaller than the number of bits to be transmitted, IT codes allow information transmission at channel capacity.