Related papers: On Intercept Probability Minimization under Sparse…
In this paper, we propose a methodology to compute the optimal finite-length coding rate for random linear network coding schemes over a line network. To do so, we first model the encoding, reencoding, and decoding process of different…
Surveillance performance is studied for a wireless eavesdropping system, where a full-duplex legitimate monitor eavesdrops a suspicious link efficiently with the artificial noise (AN) assistance. Different from the existing work in the…
In this article, a joint security and latency analysis of short packet-based low-altitude communications when the eavesdropper is close to the receiver is addressed. To reveal the impacts of the signal-to-noise ratio (SNR) and block-length…
The problem of error-control in random linear network coding is considered. A ``noncoherent'' or ``channel oblivious'' model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer…
Advances of information-theoretic understanding of sparse sampling of continuous uncoded signals at sampling rates exceeding the Landau rate were reported in recent works. This work examines sparse sampling of coded signals at sub-Landau…
In this paper we investigate the optimal latency of communications. Focusing on fixed rate communication without any feedback channel, this paper encompasses low-latency strategies with which one hop and multi-hop communication issues are…
Randomized network coding (RNC) greatly reduces the complexity of implementing network coding in large-scale, heterogeneous networks. This paper examines two tradeoffs in applying RNC: The first studies how the performance of RNC varies…
This paper considers secrecy enhancement mechanisms in visible light communication (VLC) systems with spatially distributed passive eavesdroppers (EDs) under the assumption that there are multiple LED transmitters and one legitimate…
We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a transmitter attempts to reliably communicate with a legitimate…
We discuss a method for sparse signal approximation, which is based on the correlation of the target signal with a pseudo-random signal, and uses a modification of the greedy matching pursuit algorithm. We show that this approach provides…
This paper considers a simple on-off random multiple access channel, where n users communicate simultaneously to a single receiver over m degrees of freedom. Each user transmits with probability lambda, where typically lambda n < m << n,…
We resolve the question of optimality for a well-studied packetized implementation of random linear network coding, called PNC. In PNC, in contrast to the classical memoryless setting, nodes store received information in memory to later…
This paper studies the problem of secure communication over the broadcast channel with receiver side information under the lens of individual secrecy constraints. That is, the transmitter wants to send two independent messages to two…
We consider the problem of secure communication with multi-antenna transmission in fading channels. The transmitter simultaneously transmits an information bearing signal to the intended receiver and artificial noise to the eavesdroppers.…
This paper concerns maximizing the minimum achievable secrecy rate of a two-way relay network in the presence of an eavesdropper, in which two nodes aim to exchange messages in two hops, using a multi-antenna relay. Throughout the first…
In this paper, we investigate methods for reducing the likelihood that a message transmitted between two multiantenna nodes is intercepted by an undetected eavesdropper. In particular, we focus on the judicious transmission of artificial…
In this paper, we study the problem of remote state estimation, in the presence of a passive eavesdropper. An authorized user estimates the state of an unstable linear plant, based on the packets received from a sensor, while the packets…
We propose a novel adaptive and causal random linear network coding (AC-RLNC) algorithm with forward error correction (FEC) for a point-to-point communication channel with delayed feedback. AC-RLNC is adaptive to the channel condition, that…
Secrecy encoding for remote state estimation in the presence of adversarial eavesdroppers is a well studied problem. Typical existing secrecy encoding schemes rely on the transmitter's knowledge of the remote estimator's current…
We consider a class of Gaussian layered networks where a source communicates with a destination through $L$ intermediate relay layers with $N$ nodes in each layer in the presence of a single eavesdropper which can overhear the transmissions…