English
Related papers

Related papers: On the Capacity of the Discrete Memoryless Broadca…

200 papers

This paper presents polar coding schemes for the 2-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region known to date, and it is…

Information Theory · Computer Science 2016-11-15 Marco Mondelli , S. Hamed Hassani , Igal Sason , Rüdiger Urbanke

The utility of limited feedback for coding over an individual sequence of DMCs is investigated. This study complements recent results showing how limited or noisy feedback can boost the reliability of communication. A strategy with fixed…

Information Theory · Computer Science 2016-11-17 Krishnan Eswaran , Anand D. Sarwate , Anant Sahai , Michael Gastpar

We propose a generalized feedback model and compressive sensing based opportunistic feedback schemes for feedback resource reduction in MIMO Broadcast Channels under the assumption that both uplink and downlink channels undergo block…

Information Theory · Computer Science 2016-11-18 Syed T. Qaseem , Tareq Y. Al-Naffouri

It is a well-known fact that feedback does not increase the capacity of point-to-point memoryless channels, however, its effect in secure communications is not fully understood yet. In this work, an achievable scheme for the wiretap channel…

Information Theory · Computer Science 2019-03-26 Germán Bassi , Pablo Piantanida , Shlomo Shamai

In the identification (ID) scheme proposed by Ahlswede and Dueck, the receiver's goal is simply to verify whether a specific message of interest was sent. Unlike Shannon's transmission codes, which aim for message decoding, ID codes for a…

Information Theory · Computer Science 2025-01-22 Wafa Labidi , Yaning Zhao , Christian Deppe , Holger Boche

We study a class of discrete memoryless broadcast interference channels (DM-BICs), where one of the broadcast receivers is subject to the interference from a point-to-point transmission. A general achievable rate region $\mathcal{R}$ based…

Information Theory · Computer Science 2012-06-21 Yuanpeng Liu , Elza Erkip

This article studies the zero-error feedback capacity of {\em causal} discrete channels with memory. First, by extending the classical zero-error feedback capacity concept, a new notion of {\em uniform zero-error feedback capacity} $ C_{0f}…

Information Theory · Computer Science 2022-06-02 Amir Saberi , Farhad Farokhi , Girish Nair

This paper simplifies an existing coding scheme for the two-receiver discrete memoryless broadcast channel with complementary receiver side information where there is a passive eavesdropper and individual secrecy is required. The existing…

Information Theory · Computer Science 2018-05-31 Jin Yeong Tan , Lawrence Ong , Behzad Asadi

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of…

Information Theory · Computer Science 2015-06-25 Michael Heindlmaier , Shirin Saeedi Bidokhti

The capacity of the semideterministic discrete memoryless broadcast channel (SD-BC) with partial message side-information (P-MSI) at the receivers is established. In the setting without a common message, it is shown that P-MSI to the…

Information Theory · Computer Science 2017-05-30 Annina Bracher , Michèle Wigger

We study the problem of communication over an additive white Gaussian noise (AWGN) channel with an AWGN feedback channel. When the feedback channel is noiseless, the classic Schalkwijk-Kailath (S-K) scheme is known to achieve capacity in a…

Information Theory · Computer Science 2017-01-04 Assaf Ben-Yishai , Ofer Shayevitz

The design of codes for feedback-enabled communications has been a long-standing open problem. Recent research on non-linear, deep learning-based coding schemes have demonstrated significant improvements in communication reliability over…

Information Theory · Computer Science 2023-06-09 Junghoon Kim , Taejoon Kim , David Love , Christopher Brinton

In this paper, we study the finite blocklength limits of state-dependent discrete memoryless channels where the discrete memoryless state is known noncausally at the encoder. For the point-to-point case, this is known as the…

Information Theory · Computer Science 2013-11-13 Vincent Y. F. Tan

In this paper, we examine discrete memoryless Multiple Access Channels (MACs) with two-sided feedback in the presence of two correlated channel states that are correlated in the sense of Slepian-Wolf (SW). We find achievable rate region for…

Information Theory · Computer Science 2012-12-17 Saeed Hajizadeh , Ghosheh Abed Hodtani

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

The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…

Information Theory · Computer Science 2023-06-13 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

We study channel simulation under common randomness assistance in the finite-blocklength regime and identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.…

Information Theory · Computer Science 2024-10-10 Michael X. Cao , Navneeth Ramakrishnan , Mario Berta , Marco Tomamichel

In this paper, a general binary-input binary-output (BIBO) channel is investigated in the presence of feedback and input constraints. The feedback capacity and the optimal input distribution of this setting are calculated for the case of an…

Information Theory · Computer Science 2018-01-09 Oron Sabag , Haim H. Permuter , Navin Kashyap

We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon…

Information Theory · Computer Science 2022-02-18 Moritz Wiese , Wafa Labidi , Christian Deppe , Holger Boche

Fundamental limits of the cognitive interference channel (CIC) with two pairs of transmitter-receiver has been under exploration for several years. In this paper, we study the discrete memoryless cognitive interference channel (DM-CIC) in…

Information Theory · Computer Science 2012-10-09 Mojtaba Vaezi