Common randomness in information theory and cryptography. II. CR capacity 论文

1998IEEE Transactions on Information Theory引用 260
Wireless Communication Security TechniquesChaos-based Image/Signal EncryptionError Correcting Code Techniques

摘要

For pt.I see ibid., vol.39, p.1121, 1993. The common randomness (CR) capacity of a two-terminal model is defined as the maximum rate of common randomness that the terminals can generate using resources specified by the given model. We determine CR capacity for several models, including those whose statistics depend on unknown parameters. The CR capacity is shown to be achievable robustly, by common randomness of nearly uniform distribution no matter what the unknown parameters are. Our CR capacity results are relevant for the problem of identification capacity, and also yield a new result on the regular (transmission) capacity of arbitrarily varying channels with feedback.

相关技术

暂无数据

相关事件

暂无数据

相关文章

暂无数据