Related papers: Secure Coding via Gaussian Random Fields
In this work, the problem of transmitting an i.i.d Gaussian source over an i.i.d Gaussian wiretap channel with an i.i.d Gaussian side information is considered. The intended receiver is assumed to have a certain minimum SNR and the…
An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…
Using random Gaussian vectors and an information-uncertainty relation, we give a proof that the coherent information is an achievable rate for entanglement transmission through a noisy quantum channel. The codes are random subspaces…
We study the secrecy capacity of a helper-assisted Gaussian wiretap channel with a source, a legitimate receiver, an eavesdropper and an external helper, where each terminal is equipped with multiple antennas. Determining the secrecy…
In a point-to-point communication system which consists of a sender, a receiver and a set of noiseless channels, the sender wishes to transmit a private message to the receiver through the channels which may be eavesdropped by a wiretapper.…
We study a distributionally robust optimization formulation (i.e., a min-max game) for two representative problems in Bayesian nonparametric estimation: Gaussian process regression and, more generally, linear inverse problems. Our…
The declining response rates in probability surveys along with the widespread availability of unstructured data has led to growing research into non-probability samples. Existing robust approaches are not well-developed for non-Gaussian…
Quantum physics allows for unconditionally secure communication through insecure communication channels. The achievable rates of quantum-secured communication are fundamentally limited by the laws of quantum physics and in particular by the…
When using Bayesian inference to support conservative software reliability assessments, it is useful to consider a collection of Bayesian inference problems, with the aim of determining the worst-case value (from this collection) for a…
A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…
The problem of secret sharing over the Gaussian wiretap channel is considered. A source and a destination intend to share secret information over a Gaussian channel in the presence of a wiretapper who observes the transmission through…
For the additive Gaussian noise channel with average codeword power constraint, sparse superposition codes and adaptive successive decoding is developed. Codewords are linear combinations of subsets of vectors, with the message indexed by…
This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…
We study a nonparametric Bayesian approach to linear inverse problems under discrete observations. We use the discrete Fourier transform to convert our model into a truncated Gaussian sequence model, that is closely related to the classical…
This study examines the use of nonsystematic channel codes to obtain secure transmissions over the additive white Gaussian noise (AWGN) wire-tap channel. Unlike the previous approaches, we propose to implement nonsystematic coded…
We consider the problem of reliable communication over non-binary insertion/deletion channels where symbols are randomly deleted from or inserted in the transmitted sequence and all symbols are corrupted by additive white Gaussian noise. To…
Probabilistic encoding introduces Gaussian noise into neural networks, enabling a smooth transition from deterministic to uncertain states and enhancing generalization ability. However, the randomness of Gaussian noise distorts point-based…
In this paper, the probability of Eve the Eavesdropper's correct decision is considered both in the Gaussian and Rayleigh fading wiretap channels when using lattice codes for the transmission. First, it is proved that the secrecy function…
Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To…
This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under the peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly…