English
Related papers

Related papers: Common Randomness Generation from Gaussian Sources

200 papers

Measuring quantum states provides means to generate genuine random numbers. It has been shown that genuine randomness can be obtained even with an uncharacterized quantum source. In this work, we propose a framework that formalizes the idea…

Quantum Physics · Physics 2019-05-23 Jiajun Ma , Xiao Yuan , Aishwarya Hakande , Xiongfeng Ma

Commonsense causality reasoning (CCR) aims at identifying plausible causes and effects in natural language descriptions that are deemed reasonable by an average person. Although being of great academic and practical interest, this problem…

Computation and Language · Computer Science 2022-06-20 Jiayao Zhang , Hongming Zhang , Weijie J. Su , Dan Roth

In this paper, we revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog Gaussian noise channel where the noise has an arbitrary…

Information Theory · Computer Science 2019-01-24 Ather Gattami

One of the earliest models of weak randomness is the Chor-Goldreich (CG) source. A $(t,n,k)$-CG source is a sequence of random variables $X=(X_1,\dots,X_t)\sim(\{0,1\}^n)^t$, where each $X_i$ has min-entropy $k$ conditioned on any fixing of…

Computational Complexity · Computer Science 2024-10-11 Jesse Goodman , Xin Li , David Zuckerman

We propose a random walks based model to generate complex networks. Many authors studied and developed different methods and tools to analyze complex networks by random walk processes. Just to cite a few, random walks have been adopted to…

Physics and Society · Physics 2015-06-19 Marco Alberto Javarone

We introduce the coordination principle, which states that perfect coordination, in the form of agreement on a uniformly random output, among N parties is possible only if they share a common cause. This principle is purely causal and can…

In this paper we generalize the notion of common information of two dependent variables introduced by G\'acs & K\"orner. They defined common information as the largest entropy rate of a common random variable two parties observing one of…

Information Theory · Computer Science 2016-11-17 Vinod M. Prabhakaran , Manoj M. Prabhakaran

We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a transmitter attempts to reliably communicate with a legitimate…

Information Theory · Computer Science 2025-07-21 Shi-Yuan Wang , Keerthi S. K. Arumugam , Matthieu R. Bloch

Consider a lossy compression system with $\ell$ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under…

Information Theory · Computer Science 2018-07-19 Yizhong Wang , Li Xie , Xuan Zhang , Jun Chen

We performed a billion locality sensitive hash comparisons between artificially generated data samples to answer the critical question - can we reproduce the results of generative AI models? Reproducibility is one of the pillars of…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-02-07 Edward Kim , Isamu Isozaki , Naomi Sirkin , Michael Robson

Quantum Key Distribution is the process of using quantum communication to establish a shared key between two parties. It has been demonstrated the unconditional security and effective communication of quantum communication system can be…

Signal Processing · Electrical Eng. & Systems 2019-02-04 Yue Hu , Yan Wu , Yi Chen , G. C. Wan , S. T. Mei

We demonstrate a quantum random number generator based on the random nature of the phase difference between two independent laser sources. The speed of random bit generation is determined by the photodetector bandwidth and the linewidth of…

This paper investigates the joint source-channel coding problem of sending two correlated memoryless sources with common part over a memoryless multiple access channel (MAC). An inner bound and two outer bounds on the achievable distortion…

Information Theory · Computer Science 2016-12-13 Lei Yu , Houqiang Li , Chang Wen Chen

This paper investigates the behaviour of the spectrum of generally correlated Gaussian random matrices whose columns are zero-mean independent vectors but have different correlations, under the specific regime where the number of their…

Information Theory · Computer Science 2014-12-30 Abla Kammoun , M. S. Alouini

The paper deals with distribution of singular values of product of random matrices arising in the analysis of deep neural networks. The matrices resemble the product analogs of the sample covariance matrices, however, an important…

Mathematical Physics · Physics 2020-11-23 Leonid Pastur

We consider the semi-supervised clustering problem where crowdsourcing provides noisy information about the pairwise comparisons on a small subset of data, i.e., whether a sample pair is in the same cluster. We propose a new approach that…

Machine Learning · Statistics 2018-10-30 Yucen Luo , Tian Tian , Jiaxin Shi , Jun Zhu , Bo Zhang

The problem of random number generation dates back to von Neumann's work in 1951. Since then, many algorithms have been developed for generating unbiased bits from complex correlated sources as well as for generating arbitrary distributions…

Information Theory · Computer Science 2015-03-18 David Lee , Jehoshua Bruck

Two-way communication is prevalent and its fundamental limits are first studied in the point-to-point setting by Shannon [1]. One natural extension is a two-way interference channel (IC) with four independent messages: two associated with…

Information Theory · Computer Science 2017-09-05 Changho Suh , Jaewoong Cho , David Tse

This paper investigates the secret key generation in the multiterminal source model, where users observing correlated sources discuss interactively under limited rates to agree on a secret key. We focus on a class of sources representable…

Information Theory · Computer Science 2019-07-30 Qiaoqiao Zhou , Chung Chan

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

Information Theory · Computer Science 2021-01-01 Xinchun Yu , Shuangqin Wei , Yuan Luo
‹ Prev 1 3 4 5 6 7 10 Next ›