English
Related papers

Related papers: Deterministic Identification over Channels without…

200 papers

In next-generation wireless networks, low latency often necessitates short-length codewords that either do not use channel state information (CSI) or rely solely on CSI at the receiver (CSIR). Gaussian codes that achieve capacity for AWGN…

Information Theory · Computer Science 2024-09-16 Rishabh Sharad Pomaje , Rajshekhar V Bhat

The white book released by the International Telecommunications Union (ITU) calls for extremely high-security and low-latency communication over fading channels. Under the low-latency requirement, the corresponding fading model is…

Information Theory · Computer Science 2026-04-01 Changhong Liu , Jingjing Wang , Qiaosheng Zhang , Jinpeng Xu , Lin Zhou

Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error…

Information Theory · Computer Science 2024-03-22 Ioannis Papoutsidakis , Robert J. Piechocki , Angela Doufexi

An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver.…

Information Theory · Computer Science 2015-03-13 Bernd Bandemer , Abbas El Gamal

The capacity region of the interference channel in which one transmitter non-causally knows the message of the other, termed the cognitive interference channel, has remained open since its inception in 2005. A number of subtly differing…

Information Theory · Computer Science 2015-03-13 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We show that the Extrinsic Information about the coded bits of any good (capacity achieving) code operating over a wide class of discrete memoryless channels (DMC) is zero when channel capacity is below the code rate and positive constant…

Information Theory · Computer Science 2007-07-13 Michael Peleg , Amichai Sanderovich , Shlomo Shamai

The fact that the results for 2-receiver broadcast channels (BCs) are not generalized to the 3-receiver ones is of information theoretical importance. In this paper we study two classes of discrete memoryless BCs with non-causal side…

Information Theory · Computer Science 2014-08-19 Sajjad Bahrami , Ghosheh Abed Hodtani

The two-user wireless ergodic fading Broadcast Channel (BC) with partial Channel State Information at the Transmitter (CSIT) is considered. The CSIT is given by an arbitrary deterministic function of the channel state. This characteristic…

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

This paper investigates the limits of information transfer over a fast Rayleigh fading MIMO channel, where neither the transmitter nor the receiver has the knowledge of the channel state information (CSI) except the fading statistics. We…

Information Theory · Computer Science 2007-07-13 Rasika R Perera , Tony S Pollock , Thushara D Abhayapala

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the…

Information Theory · Computer Science 2017-12-19 Johan Östman , Giuseppe Durisi , Erik G. Ström , Mustafa C. Coşkun , Gianluigi Liva

The optimal power allocation that maximizes the secrecy capacity of block fading Gaussian (BF-Gaussian) networks with causal channel state information (CSI), M-block delay tolerance and a frame based power constraint is examined. In…

Information Theory · Computer Science 2014-01-28 Arsenia Chorti , Katerina Papadaki , H. Vincent Poor

In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver.…

Information Theory · Computer Science 2018-05-08 Yanru Tang , Faeze Heydaryan , Jie Luo

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

Information Theory · Computer Science 2025-08-12 Reza K. Farsani , Wei Yu

Channel simulation is an alternative to quantization and entropy coding for performing lossy source coding. Recently, channel simulation has gained significant traction in both the machine learning and information theory communities, as it…

Information Theory · Computer Science 2026-02-10 Gergely Flamich , Sharang M. Sriramu , Aaron B. Wagner

There are currently a plurality of capacity theories of fading channels, including the ergodic capacity for fast fading channels and outage capacity for slow fading channels. However, analyses show that the outage capacity is a…

Information Theory · Computer Science 2019-04-01 Xuezhi Yang

We establish the capacity region of several classes of broadcast channels with random state in which the channel to each user is selected from two possible channel state components and the state is known only at the receivers. When the…

Information Theory · Computer Science 2015-09-16 Hyeji Kim , Abbas El Gamal

We propose a novel system identification technique, based on a least-mean square algorithm, allowing for the estimation of a linear channel by using an unknown-response measurement channel. The key of the technique is a memoryless nonlinear…

Signal Processing · Electrical Eng. & Systems 2021-10-18 Juan I. Bonetti , James Kunst , Damián A. Morero , Mario R. Hueda

This paper studies a layered erasure model for two-user interference channels, which can be viewed as a simplified version of Gaussian fading interference channel. It is assumed that channel state information~(CSI) is only available at…

Information Theory · Computer Science 2016-01-26 Yan Zhu

Wireless network scheduling and control techniques (e.g., opportunistic scheduling) rely heavily on access to Channel State Information (CSI). However, obtaining this information is costly in terms of bandwidth, time, and power, and could…

Information Theory · Computer Science 2014-04-29 Yin Sun , C. Emre Koksal , Sung-Ju Lee , Ness B. Shroff

We study binary discrimination of idempotent quantum channels. When the two channels share a common full-rank invariant state, we show that a simple image inclusion condition completely determines the asymptotic behavior: when it holds, a…

Quantum Physics · Physics 2026-03-31 Satvik Singh , Bjarne Bergh