English
Related papers

Related papers: On The Reliability Function of Discrete Memoryless…

200 papers

The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We provided a sequence of inner and outer bounds for this…

Information Theory · Computer Science 2008-02-12 Haim H. Permuter , Tsachy Weissman , Jun Chen

This work investigates the fundamental limits of communication over a noisy discrete memoryless channel that wears out, in the sense of signal-dependent catastrophic failure. In particular, we consider a channel that starts as a memoryless…

Information Theory · Computer Science 2018-08-07 Ting-Yi Wu , Lav R. Varshney , Vincent Y. F. Tan

The adaptive zero-error capacity of discrete memoryless channels (DMC) with noiseless feedback has been shown to be positive whenever there exists at least one channel output "disprover", i.e. a channel output that cannot be reached from at…

Information Theory · Computer Science 2017-04-06 Meysam Asadi , Natasha Devroye

We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive schemes, under a zero probability of error criterion. We derive single-letter inner and outer bounds for the zero-error capacity region,…

Information Theory · Computer Science 2021-09-13 Yujie Gu , Ofer Shayevitz

We study communication over a Multiple Access Channel (MAC) where users can possibly be adversarial. The receiver is unaware of the identity of the adversarial users (if any). When all users are non-adversarial, we want their messages to be…

Information Theory · Computer Science 2023-09-12 Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

We investigate the fundamental limits of reliable communication over multi-view channels, in which the channel output is comprised of a large number of independent noisy views of a transmitted symbol. We consider first the setting of…

Information Theory · Computer Science 2024-05-14 V. Arvind Rameshwar , Nir Weinberger

We consider the stationaly memoryless channels with input cost. We prove that for transmission rates above the capacity the correct probability of decoding tends to zero exponentially as the block length $n$ of codes tends to infinity. In…

Information Theory · Computer Science 2025-09-26 Yasutada Oohama

We consider the problem of shared randomness-assisted multiple access channel (MAC) simulation for product inputs and characterize the one-shot communication cost region via almost-matching inner and outer bounds in terms of the smooth…

Information Theory · Computer Science 2026-03-26 Aditya Nema , Sreejith Sreekumar , Mario Berta

We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable…

Information Theory · Computer Science 2015-12-01 Chong Li , Nicola Elia

A mechanism called switched feedback is introduced; under switched feedback, each channel output goes forward to the receiver(s) or back to the transmitter(s) but never both. By studying the capacity of the Multiple-Access Channel (MAC)…

Information Theory · Computer Science 2025-05-01 Oliver Kosut , Michael Langberg , Michelle Effros

We address the problem of universal communications over an unknown channel with an instantaneous noiseless feedback, and show how rates corresponding to the empirical behavior of the channel can be attained, although no rate can be…

Information Theory · Computer Science 2008-09-01 Ofer Shayevitz , Meir Feder

We consider the discrete memoryless degraded broadcast channels with feedback. 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…

Information Theory · Computer Science 2015-04-24 Yasutada Oohama

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

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 study communication over multiple access channels (MAC) where one of the users is possibly adversarial. When all users are non-adversarial, we want their messages to be decoded reliably. When an adversary is present, we consider two…

Information Theory · Computer Science 2019-04-29 Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

We obtain new outer bounds on the capacity regions of the two-user multiple access channel with generalized feedback (MAC-GF) and the two-user interference channel with generalized feedback (IC-GF). These outer bounds are based on the idea…

Information Theory · Computer Science 2016-11-18 Ravi Tandon , Sennur Ulukus

The problem of bistatic integrated sensing and communications over memoryless relay channels is considered, where destination concurrently decodes the message sent by the source and estimates unknown parameters from received signals with…

Information Theory · Computer Science 2026-03-05 Yao Liu , Min Li , Lawrence Ong , Aylin Yener

The wiretap channel models secure communication between two users in the presence of an eavesdropper who must be kept ignorant of transmitted messages. The performance of such a system is usually characterized by its secrecy capacity which…

Information Theory · Computer Science 2017-09-07 Holger Boche , Rafael F. Schaefer , H. Vincent Poor

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