Related papers: Information Bounds and Flatness Factor Approximati…
In this paper, the fading broadcast channel with confidential messages is studied in the presence of statistical quality of service (QoS) constraints in the form of limitations on the buffer length. We employ the effective capacity…
An additive noise channel is considered, in which the distribution of the noise is nonparametric and unknown. The problem of learning encoders and decoders based on noise samples is considered. For uncoded communication systems, the problem…
We consider the statistics of the impedance of a chaotic microwave cavity coupled to a single port. We remove the non-universal effects of the coupling from the experimental data using the radiation impedance obtained directly from the…
In this paper we provide an analytic framework for computing the expected downlink coverage probability, and the associated data rate of cellular networks, where base stations are distributed in a random manner. The provided expressions are…
This letter presents a performance comparison of two popular secrecy enhancement techniques in wireless networks: (i) creating guard zones by restricting transmissions of legitimate transmitters whenever any eavesdropper is detected in…
In the decades following Shannon's work, the quest to design codes for the additive white Gaussian noise (AWGN) channel led to the development of a rich theory, revealing a number of beautiful connections between information theory and…
In this paper, we consider the transmitter optimization problem in slow fading multiple-input-single-output (MISO) wiretap channel. The source transmits a secret message intended for $K$ users in the presence of $J$ non-colluding…
A genie-aided decoder for finite dimensional lattice codes is considered. The decoder may exhaustively search through all possible scaling factors $\alpha \in \mathbb{R}$. We show that this decoder can achieve lower word error rate (WER)…
Reconfigurability is a desired characteristic of future communication networks. From a transceiver's standpoint, this can be materialized through the implementation of fluid antennas (FAs). An FA consists of a dielectric holder, in which a…
For ergodic fading, a lattice coding and decoding strategy is proposed and its performance is analyzed for the single-input single-output (SISO) and multiple-input multiple-output (MIMO) point-to-point channel as well as the multiple-access…
This paper seeks an efficient algorithm for stochastic precoding to maximize the long-term average weighted sum rates throughout a multiple-input multiple-output (MIMO) network. Unlike many existing works that assume a particular…
Information-theoretic security -- widely accepted as the strictest notion of security -- relies on channel coding techniques that exploit the inherent randomness of the propagation channels to significantly strengthen the security of…
Lattice coding and decoding have been shown to achieve the capacity of the additive white Gaussian noise (AWGN) channel. This was accomplished using a minimum mean-square error scaling and randomization to transform the AWGN channel into a…
Despite considerable progress on the information-theoretic broadcast channel, the capacity region of fading broadcast channels with channel state known at the receivers but unknown at the transmitter remains unresolved. We address this…
We have evaluated the optimal secrecy rate for Amplify-and-Forward (AF) relay networks with multiple eavesdroppers. Assuming i.i.d. Gaussian noise at the destination and the eavesdroppers, we have devised technique to calculate optimal…
In this paper, we consider the transmission of confidential information over a $\kappa$-$\mu$ fading channel in the presence of an eavesdropper, who also observes $\kappa$-$\mu$ fading. In particular, we obtain novel analytical solutions…
In this article we revisit smoothing bounds in parallel between lattices $and$ codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian distributions and were crucial for arguing the security of many…
This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…
Secure communications is becoming increasingly relevant in the development of space technology. Well established cryptographic technology is already in place and is expected to continue to be so. On the other hand, information theoretical…
We investigate estimation of fluctuating channels and its effect on security of continuous-variable quantum key distribution. We propose a novel estimation scheme which is based on the clusterization of the estimated transmittance data. We…