English
Related papers

Related papers: On the Rate-Exponent Region of Integrated Sensing …

200 papers

We consider a relay network with two relays and a feedback link from the receiver to the sender. To obtain the achievability result, we use compress-and-forward and random binning techniques combined with deterministic binning and…

Information Theory · Computer Science 2011-09-08 Mohammad Ali Tebbi , Mahtab Mirmohseni , Mahmoud Ahmadian Attari , Mohammad Reza Aref

We propose an achievable rate-region for the two-way multiple-relay channel using decode-and-forward block Markovian coding. We identify a conflict between the information flow in both directions. This conflict leads to an intractable…

Information Theory · Computer Science 2016-07-26 Jonathan Ponniah , Liang-Liang Xie

The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop…

Information Theory · Computer Science 2015-02-17 Ritesh Kolte , Ayfer Özgür , Haim Permuter

Wireless extended reality (XR) has attracted wide attentions as a promising technology to improve users' mobility and quality of experience. However, the ultra-high data rate requirement of wireless XR has hindered its development for many…

Signal Processing · Electrical Eng. & Systems 2023-03-14 Bowen Zhang , Zhijin Qin , Geoffrey Ye Li

Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in…

Quantum Physics · Physics 2018-10-10 Haoyu Qi , Qingle Wang , Mark M. Wilde

This paper investigates an information-theoretic model of secure semantic-aware communication. For this purpose, we consider the lossy joint source-channel coding (JSCC) of a memoryless semantic source transmitted over a memoryless wiretap…

Information Theory · Computer Science 2026-05-26 Denis Kozlov , Mahtab Mirmohseni , Rahim Tafazolli

The paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes. The capacity region is shown to be strictly larger in general than the achievable…

Information Theory · Computer Science 2011-02-15 Francois Baccelli , Abbas El Gamal , David Tse

We consider the two-user interference channel with rate-limited feedback. Related prior works focus on the case where feedback links have infinite capacity, while no research has been done for the rate-limited feedback problem. Several new…

Information Theory · Computer Science 2012-05-08 Alireza Vahid , Changho Suh , Amir Salman Avestimehr

We propose a new coding scheme for the discrete memoryless two-user multi-access channel (MAC) with rate-limited feedback. Our scheme combines ideas from the Venkataramanan-Pradhan scheme for perfect feedback with ideas from the…

Information Theory · Computer Science 2015-03-12 Selma Belhadj Amor

We consider the scenario of communicating on a $3\mhyphen$user classical-quantum broadcast channel. We undertake an information theoretic study and focus on the problem of characterizing an inner bound to its capacity region. We design a…

Information Theory · Computer Science 2025-03-14 Fatma Gouiaa , Arun Padakandla

In this paper, an $n$-user Gaussian interference channel, where the power of the transmitters are subject to some upper-bounds is studied. We obtain a closed-form expression for the rate region of such a channel based on the…

Information Theory · Computer Science 2016-11-17 Hajar Mahdavi-Doost , Masoud Ebrahimi , Amir K. Khandani

This paper studies a Gaussian Z-interference channel with a rate-limited digital relay link from one receiver to another. Achievable rate regions are derived based on a combination of Han-Kobayashi common-private information splitting…

Information Theory · Computer Science 2012-04-26 Lei Zhou , Wei Yu

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

Information Theory · Computer Science 2021-01-01 Xinchun Yu , Shuangqin Wei , Yuan Luo

In connected vehicular networks, it is vital to have vehicular nodes that are capable of sensing about surrounding environments and exchanging messages with each other for automating and coordinating purpose. Towards this end, integrated…

Information Theory · Computer Science 2022-05-05 Yao Liu , Min Li , An Liu , Jianmin Lu , Tony Xiao Han

Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…

Information Theory · Computer Science 2011-10-11 Zheng Wang , Jie Luo

This paper investigates the achievability of the interference channel coding. It is clarified that the rate-splitting technique is unnecessary to achieve Han-Kobayashi and Jian-Xin-Garg inner regions. Codes are constructed by using sparse…

Information Theory · Computer Science 2022-08-26 Jun Muramatsu

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

We consider the problem of coding over the multi-user Interference Channel (IC). It is well-known that aligning the interfering signals results in improved achievable rates in certain setups involving more than two users. We argue that in…

Information Theory · Computer Science 2016-02-18 F. Shirani , S. S. Pradhan

This paper develops a unified information-theoretic framework for artificial-intelligence (AI)-aided integrated sensing and communication (ISAC), where a learning component with limited representational capacity is embedded within the…

Information Theory · Computer Science 2025-12-16 Farshad Rostami Ghadi , F. Javier Lopez-Martinez , Kai-Kit Wong , Christos Masouros

Determining the achievable rate region for networks using routing, linear coding, or non-linear coding is thought to be a difficult task in general, and few are known. We describe the achievable rate regions for four interesting networks…

Information Theory · Computer Science 2021-02-09 Randall Dougherty , Chris Freiling , Kenneth Zeger