English
Related papers

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

200 papers

The quantization of the output of a binary-input discrete memoryless channel to a smaller number of levels is considered. An algorithm which finds an optimal quantizer, in the sense of maximizing mutual information between the channel input…

Information Theory · Computer Science 2014-05-16 Brian M. Kurkoski , Hideki Yagi

The broadcast channel (BC) with one common and two private messages with leakage constraints is studied, where leakage rate refers to the normalized mutual information between a message and a channel symbol string. Each private message is…

Information Theory · Computer Science 2017-05-30 Ziv Goldfeld , Gerhard Kramer , Haim H. Permuter

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

In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (estimating) the respective states via generalized feedbacks.…

Information Theory · Computer Science 2022-04-01 Mehrasa Ahmadipour , Michele Wigger , Mari Kobayashi

We present a novel feedback protocol for wireless broadcast networks that utilize linear network coding. We consider transmission of packets from one source to many receivers over a single-hop broadcast erasure channel. Our method utilizes…

Networking and Internet Architecture · Computer Science 2015-03-19 Arman Rezaee , Linda Zeger , Muriel Médard

We investigate properties of a channel coding scheme leading to the minimum-possible frame error ratio when transmitting over a memoryless channel with rate R>C. The results are compared to the well-known properties of a channel coding…

Information Theory · Computer Science 2009-03-21 Johannes B. Huber , Thorsten Hehn

The capacity of a state-dependent discrete memoryless channel (SD-DMC) is derived for the setting where a message-cognizant rate-limited helper observes the state sequence noncausally, produces its description, and provides the description…

Information Theory · Computer Science 2023-11-15 Amos Lapidoth , Ligong Wang , Yiming Yan

Consider a pair of terminals connected by two independent additive white Gaussian noise channels, and limited by individual power constraints. The first terminal would like to reliably send information to the second terminal, within a given…

Information Theory · Computer Science 2014-12-16 Assaf Ben-Yishai , Ofer Shayevitz

In this work, we develop a joint denoising and feedback strategy for channel state information in frequency division duplex systems. In such systems, the biggest challenge is the overhead incurred when the mobile terminal has to send the…

Information Theory · Computer Science 2025-09-05 Valentina Rizzello , Wolfgang Utschick

This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the constraint that the probability that an adversary who observes the channel outputs…

Information Theory · Computer Science 2016-11-17 Ligong Wang , Gregory Wornell , Lizhong Zheng

This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper.…

Information Theory · Computer Science 2016-11-18 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

We study memoryless interference channels with gradual data arrival in the absence of feedback. The information bits arrive at the transmitters according to independent and asynchronous~(Tx-Tx asynchrony) Bernoulli processes with average…

Information Theory · Computer Science 2021-08-23 Kamyar Moshksar

In the literature, it has been shown that feedback does not increase the optimal rate-distortion region of the dirty paper channel with state estimation at the receiver (SE-R). On the other hand, it is well-known that feedback helps to…

Information Theory · Computer Science 2025-07-02 Dengfeng Xia , Han Deng , Haonan Zhang , Fan Cheng , Bin Dai , Liuguo Yin

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states and the channel…

Information Theory · Computer Science 2023-05-03 Yiqi Chen , Tobias Oechtering , Mikael Skoglund , Yuan Luo

In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the…

Information Theory · Computer Science 2017-08-04 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. The model considered here assumes…

Information Theory · Computer Science 2013-04-19 Roberto W. Nóbrega , Danilo Silva , Bartolomeu F. Uchôa-Filho

This manuscript investigates the information-theoretic limits of integrated sensing and communications (ISAC), aiming for simultaneous reliable communication and precise channel state estimation. We model such a system with a…

Information Theory · Computer Science 2024-03-29 Xinyang Li , Vlad C. Andrei , Aladin Djuhera , Ullrich J. Mönich , Holger Boche

The goal of a denoising algorithm is to reconstruct a signal from its noise-corrupted observations. Perfect reconstruction is seldom possible and performance is measured under a given fidelity criterion. In a recent work, the authors…

Information Theory · Computer Science 2009-11-11 George Gemelos , Styrmir Sigurjonsson , Tsachy Weissman

We study the fundamental network capacity of a multi-user wireless downlink under two assumptions: (1) Channels are not explicitly measured and thus instantaneous states are unknown, (2) Channels are modeled as ON/OFF Markov chains. This is…

Information Theory · Computer Science 2010-04-23 Chih-ping Li , Michael J. Neely