English
Related papers

Related papers: Fundamental Limits of Multiple-Access Integrated S…

200 papers

An outer bound to the two-receiver discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as tight as the existing bounds.

Information Theory · Computer Science 2008-07-24 Chandra Nair

In contrast to Shannon transmission codes, the size of identification (ID) codes for discrete memoryless channels (DMCs) experiences doubly exponential growth with the block length when randomized encoding is used. Additional enhancements…

Information Theory · Computer Science 2024-08-21 Yaning Zhao , Wafa Labidi , Holger Boche , Eduard Jorswieck , Christian Deppe

In this paper, the problem of secret key agreement in state-dependent multiple access channels with an eavesdropper is studied. For this model, the channel state information is non-causally available at the transmitters; furthermore, a…

Cryptography and Security · Computer Science 2013-01-23 Mohsen Bahrami , Ali Bereyhi , Mahtab Mirmohseni , Mohammad Reza Aref

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 investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…

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

Bosonic channels are important in practice as they form a simple model for free-space or fiber-optic communication. Here we consider a single-sender two-receiver pure-loss bosonic broadcast channel and determine the unconstrained capacity…

Quantum Physics · Physics 2016-11-15 Masahiro Takeoka , Kaushik P. Seshadreesan , Mark M. Wilde

We study the problem of coding over a general discrete memoryless broadcast channel controlled by random parameters. The parameters are available at the transmitter in a non-causal manner and are subject to a state masking constraint on the…

Information Theory · Computer Science 2018-10-30 Michael Dikshtein , Shlomo Shamai

This paper investigates the joint source-channel coding problem of sending two correlated memoryless sources with common part over a memoryless multiple access channel (MAC). An inner bound and two outer bounds on the achievable distortion…

Information Theory · Computer Science 2016-12-13 Lei Yu , Houqiang Li , Chang Wen Chen

This paper derives an achievable rate-distortion (R-D) region for the state-dependent discrete memoryless multiple access channel (SD-DMMAC), where the generalized feedback and causal side information are present at encoders, and the…

Information Theory · Computer Science 2024-09-27 Xinyang Li , Vlad C. Andrei , Ullrich J. Mönich , Holger Boche

We investigate the maximum rates for transmitting quantum information, distilling entanglement, and distributing secret keys between a sender and a receiver in a multipoint communication scenario, with the assistance of unlimited two-way…

Quantum Physics · Physics 2017-11-30 Riccardo Laurenza , Stefano Pirandola

We consider fundamental limits for communicating over a compound channel when the state of the channel needs to be masked. Our model is closely related to an area of study known as covert communication that is a setting in which the…

Information Theory · Computer Science 2020-12-04 Sadaf Salehkalaibar , Mohammad Hossein Yassaee , Vincent Y. F. Tan , Mehrasa Ahmadipour

In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output…

Information Theory · Computer Science 2017-09-01 Alex Dytso , Mario Goldenbaum , Shlomo Shamai , H. Vincent Poor

As a class of state-dependent channels, Markov channels have been long studied in information theory for characterizing the feedback capacity and error exponent. This paper studies a more general variant of such channels where the state…

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

This paper introduces embodied communication, a new wireless communication modality in which information is imprinted onto environmental states and recovered by the receiver through sensing. No dedicated communication transmitter is…

Information Theory · Computer Science 2026-05-12 Yulin Shao

This paper considers an information theoretic model of secure integrated sensing and communication, represented as a wiretap channel with action dependent states. This model allows securing part of a transmitted message against a sensed…

Information Theory · Computer Science 2024-09-10 Truman Welling , Onur Günlü , Aylin Yener

We study a special case of Willems's two-user multi-access channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in that only one encoder, Encoder 1, is allowed to conference;…

Information Theory · Computer Science 2016-11-17 Zohaib Hassan Awan , Abdellatif Zaidi , Luc Vandendorpe

Driven by the demands of high-frequency wireless communications in 5G and 6G systems (e.g., mmWave, sub-THz), we explore a state-dependent {\em Gaussian beam-pointing} (GBP) channel. In this model, the channel state defines an unknown angle…

Information Theory · Computer Science 2025-08-29 Siyao Li , Shuangyang Li , Giuseppe Caire

In this paper the secrecy problem in the cognitive statedependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary…

Information Theory · Computer Science 2012-08-23 Hamid G. Bafghi , Babak Seyfe

In these series of multi-part papers, a systematic study of fundamental limits of communications in interference networks is established. Here, interference network is referred to as a general single-hop communication scenario with…

Information Theory · Computer Science 2013-02-18 Reza K. Farsani

A single-letter characterization is provided for the capacity region of finite-state multiple access channels. The channel state is a Markov process, the transmitters have access to delayed state information, and channel state information…

Information Theory · Computer Science 2015-03-17 Uria Basher , Avihay Shirazi , Haim Permuter
‹ Prev 1 3 4 5 6 7 10 Next ›