English
Related papers

Related papers: Communication over Individual Channels

200 papers

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

This paper considers a sequential estimation and sensor scheduling problem in the presence of multiple communication channels. As opposed to the classical remote estimation problem that involves one perfect (noiseless) channel and one…

Information Theory · Computer Science 2015-10-02 Xiaobin Gao , Emrah Akyol , Tamer Basar

We consider a setting of non-cooperative communication where a receiver wants to recover randomly generated sequences of symbols that are observed by a strategic sender. The sender aims to maximize an average utility that may not align with…

Information Theory · Computer Science 2025-03-03 Anuj S. Vora , Ankur A. Kulkarni

For information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that feedback…

Information Theory · Computer Science 2010-11-10 M. V. Burnashev , H. Yamamoto

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

For the information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that…

Information Theory · Computer Science 2008-08-18 Marat V. Burnashev , Hirosuke Yamamoto

We define the Streaming Communication model that combines the main aspects of communication complexity and streaming. We consider two agents that want to compute some function that depends on inputs that are distributed to each agent. The…

Computational Complexity · Computer Science 2016-09-23 Lucas Boczkowski , Iordanis Kerenidis , Frédéric Magniez

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

This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding metric in terms of relative entropy. For both discrete- and…

Information Theory · Computer Science 2025-05-28 Priyanka Patel , Francesc Molina , Albert Guillén i Fàbregas

Molecular communication is a biologically-inspired method of communication with attractive properties for microscale and nanoscale devices. In molecular communication, messages are transmitted by releasing a pattern of molecules at a…

Information Theory · Computer Science 2008-12-09 Andrew W. Eckford

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

We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent…

Information Theory · Computer Science 2020-08-11 Yasutada Oohama

Several aspects of the problem of asynchronous point-to-point communication without feedback are developed when the source is highly intermittent. In the system model of interest, the codeword is transmitted at a random time within a…

Information Theory · Computer Science 2012-07-10 Aslan Tchamkerten , Venkat Chandar , Gregory Wornell

This paper considers a sequential sensor scheduling and remote estimation problem with multiple communication channels. Departing from the classical remote estimation paradigm, which involves one communication channel (noiseless or noisy),…

Systems and Control · Computer Science 2018-04-10 Xiaobin Gao , Emrah Akyol , Tamer Basar

In the problem of channel resolvability, where a given output probability distribution via a channel is approximated by transforming the uniform random numbers, characterizing the asymptotically minimum rate of the size of the random…

Information Theory · Computer Science 2017-01-31 Hideki Yagi

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

A state-dependent discrete memoryless multiple access channel is considered to model an integrated sensing and communication system, where two transmitters wish to convey messages to a receiver while simultaneously estimating the state…

Information Theory · Computer Science 2025-06-19 Yao Liu , Min Li , An Liu , Lawrence Ong , Aylin Yener

The multiple-input multiple-output interference channel is considered with perfect channel information at the transmitters and single-user decoding receivers. With all transmissions restricted to single stream beamforming, we consider the…

Information Theory · Computer Science 2023-07-19 Rami Mochaourab , Pan Cao , Eduard Jorswieck

This work investigates the fundamental limits of implementing network oblivious transfer via noisy multiple access channels and broadcast channels between honest-but-curious parties when the parties have access to general tripartite…

Information Theory · Computer Science 2026-02-04 Hadi Aghaee , Christian Deppe , Holger Boche

In this paper, transmission over time-selective, flat fading relay channels is studied. It is assumed that channel fading coefficients are not known a priori. Transmission takes place in two phases: network training phase and data…

Information Theory · Computer Science 2008-12-09 Sami Akin , Mustafa Cenk Gursoy