Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels

IF 2.2 3区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Rami Ezzine;Moritz Wiese;Christian Deppe;Holger Boche
{"title":"Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels","authors":"Rami Ezzine;Moritz Wiese;Christian Deppe;Holger Boche","doi":"10.1109/TIT.2025.3565891","DOIUrl":null,"url":null,"abstract":"We consider a standard two-source model for uniform common randomness (UCR) generation, in which two terminals (Terminal <italic>A</i> and Terminal <italic>B</i>) observe independent and identically distributed (i.i.d.) samples of a correlated finite source, and where Terminal <italic>A</i> is allowed to send information to Terminal <italic>B</i> over an arbitrary single-user channel. We provide a general theoretical framework, from which the proofs of a general formula for the UCR capacity and general bounds on the <inline-formula> <tex-math>$\\epsilon $ </tex-math></inline-formula>-UCR capacity of the specified model follow as special cases. The UCR capacity is defined as the maximum achievable CR rate such that the two terminals can agree on a common uniform or nearly uniform random variable with probability arbitrarily close to one, whereas the <inline-formula> <tex-math>$\\epsilon $ </tex-math></inline-formula>-UCR capacity is defined as the maximum CR rate that can be achieved such that the probability that the two terminals do not agree on a common uniform or nearly uniform random variable does not exceed <inline-formula> <tex-math>$\\epsilon $ </tex-math></inline-formula>, where <inline-formula> <tex-math>$0 \\lt \\epsilon \\lt 1$ </tex-math></inline-formula> is fixed. The established general formula for the UCR capacity depends on a formula characterizing the transmission capacity of arbitrary point-to-point channels, as elaborated by Verdú and Han. The derived general lower and upper bounds on the <inline-formula> <tex-math>$\\epsilon $ </tex-math></inline-formula>-UCR capacity depend on corresponding lower and upper bounds on the <inline-formula> <tex-math>$\\epsilon $ </tex-math></inline-formula>-transmission capacity, as proved by Verdú and Han for arbitrary point-to-point channels. Since we are considering general channels, the derived bounds are equal except possibly for at most countably many points, where discontinuity issues might arise. We further provide two examples of channels for which the established bounds are equal and investigate the left-continuity and monotonicity of the derived lower bound.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 7","pages":"5312-5329"},"PeriodicalIF":2.2000,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10981439/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

We consider a standard two-source model for uniform common randomness (UCR) generation, in which two terminals (Terminal A and Terminal B) observe independent and identically distributed (i.i.d.) samples of a correlated finite source, and where Terminal A is allowed to send information to Terminal B over an arbitrary single-user channel. We provide a general theoretical framework, from which the proofs of a general formula for the UCR capacity and general bounds on the $\epsilon $ -UCR capacity of the specified model follow as special cases. The UCR capacity is defined as the maximum achievable CR rate such that the two terminals can agree on a common uniform or nearly uniform random variable with probability arbitrarily close to one, whereas the $\epsilon $ -UCR capacity is defined as the maximum CR rate that can be achieved such that the probability that the two terminals do not agree on a common uniform or nearly uniform random variable does not exceed $\epsilon $ , where $0 \lt \epsilon \lt 1$ is fixed. The established general formula for the UCR capacity depends on a formula characterizing the transmission capacity of arbitrary point-to-point channels, as elaborated by Verdú and Han. The derived general lower and upper bounds on the $\epsilon $ -UCR capacity depend on corresponding lower and upper bounds on the $\epsilon $ -transmission capacity, as proved by Verdú and Han for arbitrary point-to-point channels. Since we are considering general channels, the derived bounds are equal except possibly for at most countably many points, where discontinuity issues might arise. We further provide two examples of channels for which the established bounds are equal and investigate the left-continuity and monotonicity of the derived lower bound.
在任意点对点通道上产生统一的公共随机性
我们考虑了统一共同随机性(UCR)生成的标准双源模型,其中两个终端(终端a和终端B)观察相关有限源的独立和同分布(i.i.d)样本,并且允许终端a通过任意单用户通道向终端B发送信息。我们提供了一个一般的理论框架,从这个框架中作为特例给出了UCR容量的一般公式的证明和特定模型的$\epsilon $ -UCR容量的一般界。加州能力被定义为最大可实现的CR率两个终端可以达成一个共同的统一或近均匀随机变量概率任意接近1,而\ε加州能力被定义为美元的最大CR率可以达到这样的概率两个终端不同意共同制服或几乎均匀随机变量不超过\ε,美元在0 \ lt \ε\ lt 1美元是固定的。建立的UCR容量的一般公式依赖于表征任意点对点信道传输容量的公式,如Verdú和Han所阐述的。推导出的$\epsilon $ -UCR容量的一般下界和上界取决于$\epsilon $ -传输容量的相应下界和上界,如Verdú和Han对任意点对点信道所证明的那样。由于我们考虑的是一般的通道,除了可能出现不连续问题的至多可数的点外,推导出的边界是相等的。在此基础上,我们进一步给出了两个通道的建立边界相等的例子,并研究了其导出的下界的左连续性和单调性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory 工程技术-工程:电子与电气
CiteScore
5.70
自引率
20.00%
发文量
514
审稿时长
12 months
期刊介绍: The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信