English
Related papers

Related papers: Feedback Coding Schemes for the Broadcast Channel …

200 papers

We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that…

Information Theory · Computer Science 2014-10-28 Marco Baldi , Marco Bianchi , Franco Chiaraluce , Nicola Laurenti , Stefano Tomasin , Francesco Renna

The secrecy capacity region for the K-receiver degraded broadcast channel (BC) is given for confidential messages sent to the receivers and to be kept secret from an external wiretapper. Superposition coding and Wyner's random code…

Information Theory · Computer Science 2008-12-22 Li-Chia Choo , Kai-Kit Wong

In this paper, we derive information-theoretic performance limits for secure and reliable communications over the general two-user discrete memoryless broadcast channel with side-information at the transmitter. The sender wishes to…

Information Theory · Computer Science 2011-09-27 K. G. Nagananda , Chandra R Murthy , Shalinee Kishore

Deep learning based semantic communication(DLSC) systems have shown great potential of making wireless networks significantly more efficient by only transmitting the semantics of the data. However, the open nature of wireless channel and…

Cryptography and Security · Computer Science 2023-04-21 Qi Qin , Yankai Rong , Guoshun Nan , Shaokang Wu , Xuefei Zhang , Qimei Cui , Xiaofeng Tao

The secrecy problem in the state-dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter-receiver pairs, in which the cognitive transmitter has the…

Information Theory · Computer Science 2016-05-19 Hamid G. Bafghi , Babak Seyfe , Mahtab Mirmohseni , Mohammad Reza Aref

We develop a low-complexity polar coding scheme for the discrete memoryless broadcast channel with confidential messages under strong secrecy and randomness constraints. Our scheme extends previous work by using an optimal rate of uniform…

Information Theory · Computer Science 2016-03-08 Remi A. Chou , Matthieu R. Bloch

In this paper, we propose an enhanced physical layer security approach, named joint secrecy and covert communication (JSACC), which aims to improve the performance of physical layer security (PLS). The JSACC system can dynamically switch…

Signal Processing · Electrical Eng. & Systems 2026-05-01 Yanyu Cheng , Haitao Du , Liqin Hu , Wei Yang Bryan Lim , Pan Li

This work considers the problem of mitigating information leakage between communication and sensing in systems jointly performing both operations. Specifically, a discrete memoryless state-dependent broadcast channel model is studied in…

Information Theory · Computer Science 2022-08-16 Onur Günlü , Matthieu Bloch , Rafael F. Schaefer , Aylin Yener

Physical layer approaches for generating secret encryption keys for wireless systems using channel information have attracted increased interest from researchers in recent years. This paper presents a new approach for calculating…

Information Theory · Computer Science 2023-07-11 John A. Snoap

In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of…

Information Theory · Computer Science 2013-06-11 Giovanni Geraci , Sarabjot Singh , Jeffrey G. Andrews , Jinhong Yuan , Iain B. Collings

We consider the two-receiver memoryless broadcast channel with states where each receiver requests both common and private messages, and may know part of the private message requested by the other receiver as receiver message side…

Information Theory · Computer Science 2016-11-17 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the…

Information Theory · Computer Science 2018-07-02 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

Millimeter-wave (mmWave) communications are highly promising to improve the capacity of modern wireless networks, while the physical layer security (PLS) techniques hold great potential to enhance the critical secrecy performance therein.…

Information Theory · Computer Science 2020-09-07 Yuanyu Zhang , Yulong Shen , Xiaohong Jiang , Shoji Kasahara

This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation…

Information Theory · Computer Science 2011-02-09 Hung D. Ly , Tie Liu , Yufei Blankenship

Achievable data rates in wireless systems rely heavily on the available channel state information (CSI) throughout the network. However, feedback links, which provide this information, are scarce, unreliable, and subject to security…

Information Theory · Computer Science 2021-02-08 Alireza Vahid , Shih-Chun Lin , I-Hsiang Wang

Most practical communication links are bi-directional. In these models, since the source node also receives signals, its encoder has the option of computing its output based on the signals it received in the past. On the other hand, from a…

Information Theory · Computer Science 2009-11-24 Xiang He , Aylin Yener

In this paper, we propose a physical layer security (PLS) framework for an intelligent reflecting surface (IRS)-assisted integrated sensing and semantic communication (ISASC) system, where a multi-antenna dual-functional semantic base…

Signal Processing · Electrical Eng. & Systems 2025-07-21 Hamid Amiriara , Mahtab Mirmohseni , Ahmed Elzanaty , Yi Ma , Rahim Tafazolli

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…

Information Theory · Computer Science 2017-11-01 Shaofeng Zou , Yingbin Liang , Lifeng Lai , H. Vincent Poor , Shlomo Shamai

In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second…

Information Theory · Computer Science 2016-07-13 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional…

Information Theory · Computer Science 2016-01-27 Ahmed S. Mansour , Rafael F. Schaefer , Holger Boche