English
Related papers

Related papers: Wiretap Channels: Nonasymptotic Fundamental Limits

200 papers

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the…

Information Theory · Computer Science 2020-01-14 Hao Xu , Giuseppe Caire , Cunhua Pan

In this paper we consider the robust secure beamformer design for MISO wiretap channels. Assume that the eavesdroppers' channels are only partially available at the transmitter, we seek to maximize the secrecy rate under the transmit power…

Information Theory · Computer Science 2013-10-29 Shuai Ma , Mingyi Hong , Enbin Song , Xiangfeng Wang , Dechun Sun

We consider the problem of encoding a deterministic source sequence (a.k.a.\ individual sequence) for the degraded wiretap channel by means of an encoder and decoder that can both be implemented as finite--state machines. Our first main…

Information Theory · Computer Science 2022-01-05 Neri Merhav

In this work, the critical role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is established. Unlike previous works, where a noiseless public discussion channel is used for feedback, the feed-forward and…

Information Theory · Computer Science 2016-11-18 Lifeng Lai , Hesham El Gamal , H. Vincent Poor

We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate…

Quantum Physics · Physics 2025-12-18 Giuseppe Ortolano , Stefano Pirandola , Leonardo Banchi

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the…

Information Theory · Computer Science 2015-03-17 Alexandre J. Pierrot , Matthieu R. Bloch

We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals…

Information Theory · Computer Science 2016-11-18 Matthieu R. Bloch

We prove the partial strong converse property for the discrete memoryless \emph{non-degraded} wiretap channel, for which we require the leakage to the eavesdropper to vanish but allow an asymptotic error probability $\epsilon \in [0,1)$ to…

Information Theory · Computer Science 2016-11-21 Yi-Peng Wei , Sennur Ulukus

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…

Information Theory · Computer Science 2017-07-21 Mojtaba Vaezi , Wonjae Shin , H. Vincent Poor

We study the determination problem of the channel capacity for the discrete memoryless channels in the finite blocklength regime. We derive explicit lower and upper bounds of the capacity. We shall demonstrate that the information spectrum…

Information Theory · Computer Science 2019-04-11 Yasutada Oohama

This paper investigates the asymptotics of the maximal throughput of communication over AWGN channels by $n$ channel uses under a covert constraint in terms of an upper bound $\delta$ of Kullback-Leibler divergence (KL divergence). It is…

Information Theory · Computer Science 2026-04-08 Xinchun Yu , Shuangqing Wei , Shao-Lun Huang , Xiao-Ping Zhang

We consider the multi-antenna wiretap channel in which the transmitter wishes to send a confidential message to its receiver while keeping it secret to the eavesdropper. It has been known that the secrecy capacity of such a channel does not…

Information Theory · Computer Science 2016-11-17 Mari Kobayashi , Pablo Piantanida , Sheng Yang , Shlomo Shamai

We improve the secrecy guarantees for transmission over general binary memoryless symmetric wiretap channels that relies on regular LDPC codes. Previous works showed that LDPC codes achieve secrecy capacity of some classes of wiretap…

Information Theory · Computer Science 2025-02-11 Madhura Pathegama , Alexander Barg

The two-way capacities of quantum channels determine the ultimate entanglement and secret-key distribution rates achievable by two distant parties that are connected by a noisy transmission line, in absence of quantum repeaters. Since…

Quantum Physics · Physics 2025-01-27 Francesco Anna Mele , Ludovico Lami , Vittorio Giovannetti

Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to…

Information Theory · Computer Science 2015-03-13 Hessam Mahdavifar , Alexander Vardy

In this work, the role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is investigated. A model is considered in which the feed-forward and feedback signals share the same noisy channel. More specifically, a…

Information Theory · Computer Science 2007-10-04 Lifeng Lai , Hesham El Gamal , H. Vincent Poor

This work considers the two-way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and…

Information Theory · Computer Science 2011-10-04 Aly El Gamal , O. Ozan Koyluoglu , Moustafa Youssef , Hesham El Gamal

We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…

Information Theory · Computer Science 2019-04-10 Deekshith P K , K Gautam Shenoy , Vinod Sharma

Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to…

Information Theory · Computer Science 2011-10-05 Hessam Mahdavifar , Alexander Vardy
‹ Prev 1 3 4 5 6 7 10 Next ›