{"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.
期刊介绍:
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.