Related papers: Secure Analysis Over Generalized-K Channels
In this work, we prove that a positive secure degree of freedom is achievable for a large class of Gaussian channels as long as the channel is not degraded and the channel is fully connected. This class includes the MAC wire-tap channel,…
We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…
We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is…
In this paper, we investigate the transmission probabilities in three cases (depending only on the legitimate receiver, depending only the eavesdropper, and depending on both legitimate receiver and eavesdropper) in quantum key distribution…
This paper focuses on the asymptotic analysis of a class of nonlinear one-bit precoding schemes under Rayleigh fading channels. The considered scheme employs a convex-relaxation-then-quantization (CRQ) approach to the well-known minimum…
Node selection is a simple technique to achieve diversity and thereby enhance the physical layer security in future wireless communication systems which require low complexity. High-speed data transmission often encounters frequency…
The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information…
Recently, significant progress has been made in understanding the generalization of neural networks (NNs) trained by gradient descent (GD) using the algorithmic stability approach. However, most of the existing research has focused on…
This paper proposes a fast and accurate surface normal estimation method which can be directly used on depth maps (organized point clouds). The surface normal estimation process is formulated as a closed-form expression. In order to reduce…
We revisit the problem of computing (robust) controlled invariant sets for discrete-time linear systems. Departing from previous approaches, we consider implicit, rather than explicit, representations for controlled invariant sets.…
Deterministic $K$-identification (DKI) is addressed for Gaussian channels with slow fading (GSF), where the transmitter is restricted to an average power constraint and channel side information is available at the decoder. We derive lower…
Flat-fading channels that are correlated in time are considered under peak and average power constraints. For discrete-time channels, a new upper bound on the capacity per unit time is derived. A low SNR analysis of a full-scattering vector…
In this work, we analyze an efficient sampling-based algorithm for general-purpose reachability analysis, which remains a notoriously challenging problem with applications ranging from neural network verification to safety analysis of…
The $K$-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends $K$ messages to $K$ receivers, and the channel quality gradually degrades from receiver $K$ to receiver 1. Each…
A k-system of the graph G(P) of a simple polytope P is a set of induced subgraphs of G(P) that shares certain properties with the set of subgraphs induced by the k-faces of P. This new concept leads to polynomial-size certificates in terms…
The research presents a procedure of the closed-form average bit error rate evaluation for wireless communication systems in the presence of multipath fading. A generalization of the classical moment generating function is applied, and a…
The secrecy performance in both near-field and far-field communications is analyzed using two fundamental metrics: the secrecy capacity under a power constraint and the minimum power requirement to achieve a specified secrecy rate target.…
The higher-order statistics (HOS) of the channel capacity $\mu_n=\mathbb{E}[\log^n(1+\gamma_{end})]$, where $n\in\mathbb{N}$ denotes the order of the statistics, has received relatively little attention in the literature, due in part to the…
Due to the intrinsic point-to-point characteristic of quantum key distribution (QKD) systems, it is necessary to study and develop QKD network technology to provide a secure communication service for a large-scale of nodes over a large…
This letter presents a comprehensive framework analyzing the asymptotic error performance of a multiple-input-multiple-output (MIMO) wireless system employing spatial modulation (SM) with maximum likelihood detection and perfect channel…