Related papers: Learning End-to-End Codes for the BPSK-constrained…
We present a natural and low-complexity technique for achieving the capacity of the Gaussian relay network in the high SNR regime. Specifically, we propose the use of end-to-end structured lattice codes with the amplify-and-forward…
In this paper, we study a remote source coding scenario in which binary phase shift keying (BPSK) modulation sources are corrupted by additive white Gaussian noise (AWGN). An intermediate node, such as a relay, receives these observations…
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…
We consider the usage of finite-length polar codes for the Gaussian multiple access channel (GMAC) with a finite number of users. Based on the interleave-division multipleaccess (IDMA) concept, we implement an iterative detection and…
Recent results have shown that structured codes can be used to construct good channel codes, source codes and physical layer network codes for Gaussian channels. For Gaussian channels with secrecy constraints, however, efforts to date rely…
We consider the wiretap channel, where the individual channel uses have memory or are influenced by an adversary. We analyze the explicit and computationally efficient construction of information-theoretically secure coding schemes which…
Wireless sensors are everywhere. To address their energy supply, we proposed an end-to-end design for polar-coded integrated data and energy networking (IDEN), where the conventional signal processing modules, such as…
The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such that observing links in any permissible wiretap set reveals no information about the message. This paper…
We study the transmission of confidential messages across a wireless broadcast channel with K>2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the…
Deep Neural Networks (DNNs) are analyzed via the theoretical framework of the information bottleneck (IB) principle. We first show that any DNN can be quantified by the mutual information between the layers and the input and output…
We consider binary systematic network codes and investigate their capability of decoding a source message either in full or in part. We carry out a probability analysis, derive closed-form expressions for the decoding probability and show…
The wiretap channel model of Wyner is one of the first communication models with both reliability and security constraints. Capacity-achieving schemes for various models of the wiretap channel have received considerable attention in recent…
Deep learning methods have recently been used to construct non-linear codes for the additive white Gaussian noise (AWGN) channel with feedback. However, there is limited understanding of how these black-box-like codes with many learned…
We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder for a binary block code to exploit soft information obtained…
This paper is concerned with the general multiple access wiretap channel and the existence of codes that accomplish reliability and strong secrecy. Information leakage to the eavesdropper is assessed by the variational distance metric,…
A core problem in communications is the optimal discrimination of binary-phase-shift-keyed (BPSK) signals. A longstanding goal has been to reach the fundamental quantum limit, known as the Helstrom bound, for BPSK signals encoded in…
Polar codes have been proven to be capacity achieving for any binary-input discrete memoryless channel, while at the same time they can reassure secure and reliable transmission over the single-input single-output wireless channel. However,…
We consider the special case of index coding over the Gaussian broadcast channel where each receiver has prior knowledge of a subset of messages at the transmitter and demands all the messages from the source. We propose a concatenated…
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 available at the intended receiver is considered. The intended receiver is assumed to have a…
Achieving information-theoretic security using explicit coding scheme in which unlimited computational power for eavesdropper is assumed, is one of the main topics is security consideration. It is shown that polar codes are capacity…