In a recent paper, the authors introduced a lattice invariant called "Secrecy Gain" which measures the confusion experienced by a passive eavesdropper on the Gaussian Wiretap Channel. We study, here, the behavior of this invariant for unimodular lattices by using tools from Modular Forms and show that, for some families of unimodular lattices, indexed by the dimension, the secrecy gain exponentially goes to infinity with the dimension.
We consider lattice coding for the Gaussian wiretap channel, where the challenge is to ensure reliable communication between two authorized parties while preventing an eavesdropper from learning the transmitted messages. Recently, a measure called the secrecy function of a lattice coding scheme was proposed as a design criterion to characterize the eavesdropper's probability of correct decision. In this paper, the family of formally unimodular lattices is presented and shown to possess the same secrecy function behavior as unimodular and isodual lattices. Based on Construction A, we provide a …
Lattice coding over a Gaussian wiretap channel, where an eavesdropper listens to transmissions between a transmitter and a legitimate receiver, is considered. A new lattice invariant called the secrecy gain is used as a code design criterion for wiretap lattice codes since it was shown to characterize the confusion that a chosen lattice can cause at the eavesdropper: the higher the secrecy gain of the lattice, the more confusion. In this paper, a formula for the secrecy gain of unimodular lattices is derived. Secrecy gains of extremal odd unimodular lattices as well as unimodular lattices in d…
We show that on an $n=24m+8k$-dimensional even unimodular lattice, if the shortest vector length is $\geq 2m$, then as the number of vectors of length $2m$ decreases, the secrecy gain increases. We will also prove a similar result on general unimodular lattices. Furthermore, assuming the conjecture by Belfiore and Solé, we will calculate the difference between inverses of secrecy gains as the number of vectors varies. Finally, we will show by an example that there exist two lattices in the same dimension with the same shortest vector length and the same kissing number, but different secrecy ga…
We study the Gaussian multiple-input multiple-output (MIMO) wiretap channel, which consists of a transmitter, a legitimate user, and an eavesdropper. In this channel, the transmitter sends a common message to both the legitimate user and the eavesdropper. In addition to this common message, the legitimate user receives a private message, which is desired to be kept hidden as much as possible from the eavesdropper. We obtain the entire capacity-equivocation region of the Gaussian MIMO wiretap channel. This region contains all achievable common message, private message, and private message's equ…
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 another Gaussian channel. Two constraints are imposed on the source-to-destination channel; namely, the source can transmit only binary phase shift keyed (BPSK) symbols, and symbol-by-symbol hard-decision quantization is applied to the received symbols of the destination. An error-free public channel is also available for the source and destination to exchange me…
We consider the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise (AWGN) channel, while Eve is eavesdropping, also through an AWGN channel. We propose a coding strategy based on lattice coset encoding. We analyze Eve's probability of decoding, from which we define the secrecy gain as a design criterion for wiretap lattice codes, expressed in terms of the lattice theta series, which characterizes Eve's confusion as a function of the channel parameters. The secrecy gain is studied for even unimodular lattices, and an asymptotic…
We consider the Gaussian wiretap channel with M helpers, where no eavesdropper channel state information (CSI) is available at the legitimate entities. The exact secure d.o.f. of the Gaussian wiretap channel with M helpers with perfect CSI at the transmitters was found in [1], [2] to be M/(M+1). One of the key ingredients of the optimal achievable scheme in [1], [2] is to align cooperative jamming signals with the information symbols at the eavesdropper to limit the information leakage rate. This required perfect eavesdropper CSI at the transmitters. Motivated by the recent result in [3], we p…
In this work we study the reliability and secrecy performance achievable by practical LDPC codes over the Gaussian wiretap channel. While several works have already addressed this problem in asymptotic conditions, i.e., under the hypothesis of codewords of infinite length, only a few approaches exist for the finite length regime. We propose an approach to measure the performance of practical codes and compare it with that achievable in asymptotic conditions. Moreover, based on the secrecy metrics we adopt to achieve this target, we propose a code optimization algorithm which allows to design i…
A coding scheme based on irregular low-density parity-check (LDPC) codes is proposed to send secret messages from a source over the Gaussian wiretap channel to a destination in the presence of a wiretapper, with the restriction that the source can send only binary phase-shift keyed (BPSK) symbols. The secrecy performance of the proposed coding scheme is measured by the secret message rate through the wiretap channel as well as the equivocation rate about the message at the wiretapper. A code search procedure is suggested to obtain irregular LDPC codes that achieve good secrecy performance in s…
This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each equipped with multiple antennas. In this paper, we first revisit the rank property of the optimal input covariance matrix that achieves the secrecy capacity of the multiple antenna MIMO Gaussian wiretap channel under the average power constraint. Next, we obtain necessary and sufficient conditions on the MIMO wiretap channel parameters such that the optimal input covariance matrix is full-rank, and we fully characterize t…
Lattice coding for the Gaussian wiretap channel is considered, where the goal is to ensure reliable communication between two authorized parties while preventing an eavesdropper from learning the transmitted messages. Recently, a measure called secrecy gain was proposed as a design criterion to quantify the secrecy-goodness of the applied lattice code. In this paper, the theta series of the so-called formally unimodular lattices obtained by Construction $\text{A}_4$ from codes over $\mathbb{Z}_4$ is derived, and we provide a universal approach to determine their secrecy gains. Initial results …
We study deterministic approximations of the Gaussian two-user multiple access wiretap channel (G-MAC-WT) and the Gaussian wiretap channel with a helper (G-WT-H). These approximations enable results beyond the recently shown 2/3 and 1/2 secure degrees of freedom (s.d.o.f.) for the G-MAC-WT and the G-WT-H, respectively. While the s.d.o.f. were obtained by real interference alignment, our approach uses signal-scale alignment. We show achievable schemes which are independent of the rationality of the channel gains. Moreover, our results can differentiate between channel strengths, in particular b…
We consider lattice coset-coded transmissions over a wiretap channel with additive white Gaussian noise (AWGN). Examining a function that can be interpreted as either the legitimate receiver's error probability or the eavesdropper's correct decision probability, we rigorously show that, albeit offering simple bit labeling, orthogonal nested lattices are suboptimal for coset coding in terms of both the legitimate receiver's and the eavesdropper's probabilities.
In this work, an explicit wiretap coding scheme based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. Firstly, polar lattices are used to construct secrecy-good lattices for the mod-$Λ_s$ Gaussian wiretap channel. Then we propose an explicit shaping scheme to remove this mod-$Λ_s$ front end and extend polar lattices to the genuine Gaussian wiretap channel. The shaping technique is based on the lattice Gaussian distribution, which leads to a binary asymmetric channel at each level for the multilevel lattice codes. By emp…
We propose the notion of secrecy gain as a code design criterion for wiretap lattice codes to be used over an additive white Gaussian noise channel. Our analysis relies on the error probabilites of both the legitimate user and the eavesdropper. We focus on geometrical properties of lattices, described by their theta series, to characterize good wiretap codes.
This work studies the secrecy-capacity of a scalar-Gaussian wiretap channel with an amplitude constraint on the input. It is known that for this channel, the secrecy-capacity-achieving distribution is discrete with finitely many points. This work improves such result by showing an upper bound of the order $\frac{\mathsf{A}}{σ_1^2}$ where $\mathsf{A}$ is the amplitude constraint and $σ_1^2$ is the variance of the Gaussian noise over the legitimate channel.
We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter sends a pair of public and confidential messages to each legitimate user. While there are no secrecy constraints on the public messages, confidential messages need to be transmitted in perfect secrecy. We study the discrete memoryless multi-receiver wiretap channel as well as its Gaussian multi-input multi-output (MIMO) instance. First, we consider the degraded…
From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with the strong security. Our construction can achieve the wiretap capacity under mild assumptions. The key tool is the new privacy amplification theorem bounding the eavesdropped information in terms of the Gallager function.
We propose a new scheme of wiretap lattice coding that achieves semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our security proof is the flatness factor which characterizes the convergence of the conditional output distributions corresponding to different messages and leads to an upper bound on the information leakage. We not only introduce the notion of secrecy-good lattices, but also propose the {flatness factor} as a design criterion of such lattices. Both the modulo-lattice Gaussian channel and the genuine Gaussian channel are considered. In the lat…
Polar lattices, which are constructed from polar codes, are provably good for the additive white Gaussian noise (AWGN) channel. In this work, we propose a new polar lattice construction that achieves the secrecy capacity under the strong secrecy criterion over the mod-$Λ$ Gaussian wiretap channel. This construction leads to an AWGN-good lattice and a secrecy-good lattice simultaneously. The design methodology is mainly based on the equivalence in terms of polarization between the $Λ/Λ'$ channel in lattice coding and the equivalent channel derived from the chain rule of mutual information in mu…
Due to the broadcast nature of the wireless medium, wireless communication is susceptible to adversarial eavesdropping. This paper describes how eavesdropping can potentially be defeated by exploiting the superposition nature of the wireless medium. A Gaussian wire-tap channel with a helping interferer (WTC-HI) is considered in which a transmitter sends confidential messages to its intended receiver in the presence of a passive eavesdropper and with the help of an interferer. The interferer, which does not know the confidential message assists the confidential message transmission by sending a…
In this work we study encoding/decoding schemes for the transmission of a discrete time analog Gaussian source over a Gaussian wiretap channel. The intended receiver is assumed to have a certain minimum signal to noise ratio (SNR) and the eavesdropper is assumed to have a strictly lower SNR compared to the intended receiver. For a fixed information leakage to the eavesdropper, we are interested in minimizing the distortion in source reconstruction at the intended receiver, and we propose joint source channel coding (JSCC) schemes for this setup. For a fixed information leakage to the eavesdrop…
The Schalkwijk-Kailath (SK) scheme, which achieves the capacity of the point-to-point white Gaussian channel with feedback, is secure by itself and also achieves the secrecy capacity of the Gaussian wiretap channel with feedback, i.e., the SK scheme is a self-secure capacity-achieving (SSCA) feedback scheme for the Gaussian wiretap channel. For the multi-user wiretap channels, recently, it has been shown that Ozarow's capacity-achieving feedback scheme for the two-user Gaussian multiple-access channel (GMAC) is the SSCA feedback scheme for the two-user Gaussian multiple-access wiretap channel …
It has been shown recently that coding for the Gaussian Wiretap Channel can be done with nested lattices. A fine lattice intended to the legitimate user must be designed as a usual lattice code for the Gaussian Channel, while a coarse lattice is added to introduce confusion at the eavesdropper, whose theta series must be minimized. We present a design criterion for both the fine and coarse lattice to obtain wiretap lattice codes for the Rayleigh fading Wiretap Channel.
This paper studies a scalar Gaussian wiretap channel where instead of an average input power constraint, we consider a peak amplitude constraint on the input. The goal is to obtain insights into the secrecy-capacity and the structure of the secrecy-capacity-achieving distribution. Capitalizing on the recent theoretical progress on the structure of the secrecy-capacity-achieving distribution, this paper develops a numerical procedure, based on the gradient ascent algorithm and a version of the Blahut-Arimoto algorithm, for computing the secrecy-capacity and the secrecy-capacity-achieving input …
We study a symmetric Gaussian wiretap channel with a helper, where a confidential message is sent from a transmitter to a legitimate receiver, in the presence of a helper and an eavesdropper, under a weak notion of secrecy constraint. For this setting, we characterize the optimal secure generalized degrees-of-freedom (GDoF). The result reveals that, adding a helper can significantly increase the secure GDoF of the wiretap channel. The result is supported by a new converse and a new scheme. In the proposed scheme, the helper sends a cooperative jamming signal at a specific power level and direc…
This work concerns the behavior of "good" (capacity achieving) codes in several multi-user settings in the Gaussian regime, in terms of their minimum mean-square error (MMSE) behavior. The settings investigated in this context include the Gaussian wiretap channel, the Gaussian broadcast channel (BC) and the Gaussian BC with confidential messages (BCC). In particular this work addresses the effects of transmitting such codes on unintended receivers, that is, receivers that neither require reliable decoding of the transmitted messages nor are they eavesdroppers that must be kept ignorant, to som…
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 distributed on a single sphere is optimal; this regime is termed the small-amplitude regime. The asymptotic of $\bar{\mathsf{R}}_n$ as $n$ goes to infinity is completely characterized as a function of noise variance at both receivers. Moreover, the secrecy-capacity is also characterized in a form amenable for computation. Furthermore, several numerical examples ar…
We study the Gaussian MIMO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, each equipped with multiple antennas. The transmitter sends confidential messages to its intended receiver, while the helper transmits jamming signals independent of the source message to confuse the eavesdropper. The jamming signal is assumed to be treated as noise at both the intended receiver and the eavesdropper. We obtain a closed-form expression for the structure of the artificial noise covariance matrix that guarantees no decrease in the secrecy capacity of the w…
In this paper, the individual secrecy of two-way wiretap channel is investigated, where two legitimate users' messages are separately guaranteed secure against an external eavesdropper. For one thing, in some communication scenarios, the joint secrecy is impossible to achieve both positive secrecy rates of two users. For another, the individual secrecy satisfies the secrecy demand of many practical communication systems. Thus, firstly, an achievable secrecy rate region is derived for the general two-way wiretap channel with individual secrecy. In a deterministic channel, the region with indivi…
We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitter and the receivers are available everywhere, while the legitimate pair have no information about the eavesdroppers' channels. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme base…
The problem of sending a secret message over the Gaussian multiple-input multiple-output (MIMO) wiretap channel is studied. While the capacity of this channel is known, it is not clear how to construct optimal coding schemes that achieve this capacity. In this work, we use linear operations along with successive interference cancellation to attain effective parallel single-antenna wiretap channels. By using independent scalar Gaussian wiretap codebooks over the resulting parallel channels, the capacity of the MIMO wiretap channel is achieved. The derivation of the schemes is based upon joint t…
Recent investigations have shown that the sum secure degrees of freedom of the Gaussian wiretap channel with a helper is $\tfrac{1}{2}$. The achievable scheme for this result is based on the real interference alignment approach. While providing a good way to show degrees of freedom results, this technique has the disadvantage of relying on the Khintchine-Groshev theorem and is therefore limited to {\it almost all channel gains}. This means that there are infinitely many channel gains, where the scheme fails. Furthermore, the real interference alignment approach cannot be used to yield stronger…
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 capacity in this scenario generally requires solving a nonconvex secrecy rate maximization (SRM) problem. To deal with this issue, we first reformulate the original SRM problem into a sequence of convex subproblems. For the special case of single-antenna legitimate receiver, we obtain the secrecy capacity via a combination of convex optimization and one-dimensiona…
End-to-end learning of communication systems with neural networks and particularly autoencoders is an emerging research direction which gained popularity in the last year. In this approach, neural networks learn to simultaneously optimize encoding and decoding functions to establish reliable message transmission. In this paper, this line of thinking is extended to communication scenarios in which an eavesdropper must further be kept ignorant about the communication. The secrecy of the transmission is achieved by utilizing a modified secure loss function based on cross-entropy which can be impl…
The design of lattice coset codes for wiretap channels is considered. Bounds on the eavesdropper's correct decoding probability and information leakage are first revisited. From these bounds, it is explicit that both the information leakage and error probability are controlled by the average flatness factor of the eavesdropper's lattice, which we further interpret geometrically. It is concluded that the minimization of the (average) flatness factor of the eavesdropper's lattice leads to the study of well-rounded lattices, which are shown to be among the optimal in order to achieve these minima…
We consider a complex Gaussian wiretap channel with finite-resolution analog-to-digital converters (ADCs) at both the legitimate receiver and the eavesdropper. For this channel, we show that a positive secrecy rate is always achievable as long as the channel gains at the legitimate receiver and at the eavesdropper are different, regardless of the quantization levels of the ADCs. For the achievability, we first consider the case of one-bit ADCs at the legitimate receiver and apply a binary input distribution where the two input points have the same phase when the channel gain at the legitimate …
This paper considers a Gaussian multi-input multi-output (MIMO) multiple access wiretap (MAC-WT) channel, where an eavesdropper (Eve) wants to extract the confidential information of all users. Assuming that both the legitimate receiver and Eve jointly decode their interested messages, we aim to maximize the sum secrecy rate of the system by precoder design. Although this problem could be solved by first using the iterative majorization minimization (MM) based algorithm to get a sequence of convex log-determinant optimization subproblems and then using some general tools, e.g., the interior po…
We consider block codes for degraded wiretap channels in which the legitimate receiver decodes the message with an asymptotic error probability no larger than $\varepsilon$ but the leakage to the eavesdropper vanishes. For discrete memoryless and Gaussian wiretap channels, we show that the maximum rate of transmission does not depend on $\varepsilon\in [0,1)$, i.e., such channels possess the partial strong converse property. Furthermore, we derive sufficient conditions for the partial strong converse property to hold for memoryless but non-stationary symmetric and degraded wiretap channels. Ou…
This paper presents a scheme named code hopping (CodeHop) for gaussian wiretap channels based on nonsystematic low-density parity-check (LDPC) codes. Different from traditional communications, in the CodeHop scheme, the legitimate receiver (Bob) rapidly switches the parity-check matrix upon each correctly received source message block. Given an authenticated public feedback channel, the transmitter's (Alice) parity-check matrix can also be synchronized with the receiver's. As a result, once an eavesdropper (Eve) erroneously decodes a message block, she may not be able to follow the update of s…
A Gaussian multiple-input multiple-output wiretap channel in which the eavesdropper and legitimate receiver are equipped with arbitrary numbers of antennas and the transmitter has two antennas is studied in this paper. Under an average power constraint, the optimal input covariance to obtain the secrecy capacity of this channel is unknown, in general. In this paper, the input covariance matrix required to achieve the capacity is determined. It is shown that the secrecy capacity of this channel can be achieved by linear precoding. The optimal precoding and power allocation schemes that maximize…
We consider linear precoder design for a multiple-input multiple-output (MIMO) Gaussian wiretap channel, which comprises two legitimate nodes, i.e., Alice and Bob, operating in Full-Duplex (FD) mode and exchanging confidential messages in the presence of a passive eavesdropper. Using the sum secrecy degrees of freedoms (sum S.D.o.F.) as reliability measure, we formulate an optimization problem with respect to the precoding matrices. In order to solve this problem, we first propose a cooperative secrecy transmission scheme, and prove that its feasible set is sufficient to achieve the maximum su…
Optimal signalling over the Gaussian MIMO wire-tap channel is studied under the total transmit power constraint. A closed-form solution for an optimal transmit covariance matrix is obtained when the channel is strictly degraded. In combination with the rank-1 solution, this provides the complete characterization of the optimal covariance for the case of two transmit antennas. The cases of weak eavesdropper and high SNR are considered. It is shown that the optimal covariance does not converge to a scaled identity in the high-SNR regime. Necessary optimality conditions and a tight upper bound on…
This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are shown to be tighter than existing bounds. The bounds also lead to the tightest second-order coding rate for discrete memoryless and Gaussian wiretap channels.
In this paper, we present nontrivial upper and lower bounds on the secrecy capacity of the degraded Gaussian diamond-wiretap channel and identify several ranges of channel parameters where these bounds coincide with useful intuitions. Furthermore, we investigate the effect of the presence of an eavesdropper on the capacity. We consider the following two scenarios regarding the availability of randomness: 1) a common randomness is available at the source and the two relays and 2) a randomness is available only at the source and there is no available randomness at the relays. We obtain the upper…
In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical knowledge of the eavesdroppers CSI are assumed. We first consider the MIMO wiretap channel with Gaussian input. Using Jensen's inequality, we transform the secrecy rate max-min optimization problem to a single maximization problem. We use generalized singular value decomposition and transform the problem to a concave maximization problem which maximizes the sum secr…
We study the secure degrees of freedom (d.o.f.) of one-hop wireless networks by considering four fundamental Gaussian network structures: wiretap channel, broadcast channel with confidential messages, interference channel with confidential messages, and multiple access wiretap channel. The secure d.o.f. of the canonical Gaussian wiretap channel with no helpers is zero. It has been known that a strictly positive secure d.o.f. can be obtained in the Gaussian wiretap channel by using a helper which sends structured cooperative signals. We show that the exact secure d.o.f. of the Gaussian wiretap …
This paper considers a multiple-input multiple-output (MIMO) Gaussian wiretap channel model, where there exists a transmitter, a legitimate receiver and an eavesdropper, each equipped with multiple antennas. Perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while ensuring that the eavesdropper gets zero bits of information. In this paper, the perfect secrecy capacity of the multiple antenna MIMO wiretap channel is found for aribtrary numbers of antennas under the assumption that the transmitter performs beamforming based on the …
This work investigates the effect of finite-alphabet source input on the secrecy rate of a multi-antenna wiretap system. Existing works have characterized maximum achievable secrecy rate or secrecy capacity for single and multiple antenna systems based on Gaussian source signals and secrecy code. Despite the impracticality of Gaussian sources, the compact closed-form expression of mutual information between linear channel Gaussian input and corresponding output has led to broad application of Gaussian input assumption in physical secrecy analysis. For practical considerations, we study the eff…
In this paper, we consider the Gaussian diamond-wiretap channel that consists of an orthogonal broadcast channel from a source to two relays and a Gaussian fast-fading multiple access-wiretap channel from the two relays to a legitimate destination and an eavesdropper. For the multiple access part, we consider both the case with full channel state information (CSI) and the case with no eavesdropper's CSI, at the relays and the legitimate destination. For both the cases, we establish the exact secure degrees of freedom and generalize the results for multiple relays. For the converse part, we int…
This paper considers the problem of filter design with secrecy constraints, where two legitimate parties (Alice and Bob) communicate in the presence of an eavesdropper (Eve), over a Gaussian multiple-input-multiple-output (MIMO) wiretap channel. This problem involves designing, subject to a power constraint, the transmit and the receive filters which minimize the mean-squared error (MSE) between the legitimate parties whilst assuring that the eavesdropper MSE remains above a certain threshold. We consider a general MIMO Gaussian wiretap scenario, where the legitimate receiver uses a linear Zer…
The Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel is studied in this paper. The base station broadcasts confidential messages to K intended users while keeping the messages secret from an eavesdropper. The capacity of this channel has already been characterized by applying dirty-paper coding and stochastic encoding. However, K factorial encoding orders may need to be enumerated for that, which makes the problem intractable. We prove that there exists one optimal encoding order and reduced the K factorial times to a one-time encoding. The optimal encoding order i…
In this paper, we investigate the effects of an additional trusted relay node on the secrecy of multiple-access wiretap channel (MAC-WT) by considering the model of multiple-access relay wiretap channel (MARC-WT). More specifically, first, we investigate the discrete memoryless MARC-WT. Three inner bounds (with respect to decode-forward (DF), noise-forward (NF) and compress-forward (CF) strategies) on the secrecy capacity region are provided. Second, we investigate the degraded discrete memoryless MARC-WT, and present an outer bound on the secrecy capacity region of this degraded model. Finall…
A novel precoding method based on supervised deep neural networks is introduced for the multiple-input multiple-output Gaussian wiretap channel. The proposed deep learning (DL)-based precoding learns the input covariance matrix through offline training over a large set of input channels and their corresponding covariance matrices for efficient, reliable, and secure transmission of information. Furthermore, by spending time in offline training, this method remarkably reduces the computation complexity in real-time applications. Compared to traditional precoding methods, the proposed DL-based pr…
