English
Related papers

Related papers: Semi-constrained Systems

200 papers

The problem of characterising the zero-error capacity region for multiple access channels even in the noiseless case has remained an open problem for over three decades. Motivated by this challenging question, a recently developed theory of…

Information Theory · Computer Science 2019-10-29 Ghassen Zafzouf , Girish N. Nair , Jamie S. Evans

Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be significantly smaller than the power consumed in decoding. This…

Information Theory · Computer Science 2011-02-17 Pulkit Grover , Kristen Ann Woyach , Anant Sahai

In this paper we present several strategies for multiple relay networks which are constrained by a half-duplex operation, i. e., each node either transmits or receives on a particular resource. Using the discrete memoryless multiple relay…

Information Theory · Computer Science 2007-12-24 P. Rost , G. Fettweis

In this paper, a dual-hop communication system composed of a source S and a destination D connected through two non-interfering half-duplex relays, R1 and R2, is considered. In the literature of Information Theory, this configuration is…

Information Theory · Computer Science 2016-11-17 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

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

We consider the problem of communicating over a channel that breaks the message block into fragments of random lengths, shuffles them out of order, and deletes a random fraction of the fragments. Such a channel is motivated by applications…

Information Theory · Computer Science 2024-07-09 Aditya Narayan Ravi , Alireza Vahid , Ilan Shomorony

In this letter, we introduce the computational-limited (comp-limited) signals, a communication capacity regime in which the signal time computational complexity overhead is the key constraint -- rather than power or bandwidth -- to the…

Information Theory · Computer Science 2024-10-28 Saulo Queiroz , João P. Vilela , Edmundo Monteiro

This paper investigates the asymptotic behavior of the deterministic and stochastic Cram\'er-Rao Bounds (CRB) for semi-blind channel estimation in massive multiple-input multiple-output (MIMO) systems. We derive and analyze mathematically…

Signal Processing · Electrical Eng. & Systems 2025-07-15 Xue Zhang , Abla Kammoun , Mohamed-Slim Alouini

We consider the problem of a semiclassical description of quantum chaotic transport, when a tunnel barrier is present in one of the leads. Using a semiclassical approach formulated in terms of a matrix model, we obtain transport moments as…

Chaotic Dynamics · Physics 2022-07-06 Pedro H. S. Bento , Marcel Novaes

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

This paper, mostly tutorial in nature, deals with the problem of characterizing the capacity of fading channels in the high signal-to-noise ratio (SNR) regime. We focus on the practically relevant noncoherent setting, where neither…

Information Theory · Computer Science 2011-05-09 Giuseppe Durisi , Helmut Bölcskei

This paper proposes a novel semiotic framework for analyzing Large Language Models (LLMs), conceptualizing them as stochastic semiotic engines whose outputs demand active, asymmetric human interpretation. We formalize the trade-off between…

Information Theory · Computer Science 2025-11-26 Davide Picca

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 work considers a communication scenario where the transmitter chooses a list of size K from a total of M messages to send over a noisy communication channel, the receiver generates a list of size L and communication is considered…

Information Theory · Computer Science 2014-10-14 Mustafa Anil Kocak , Elza Erkip

We consider transmission of stationary and ergodic sources over non-ergodic composite channels with channel state information at the receiver (CSIR). Previously we introduced alternate capacity definitions to Shannon capacity, including the…

Information Theory · Computer Science 2009-02-27 Yifan Liang , Andrea Goldsmith , Michelle Effros

Consider the broadcast relay channel (BRC) which consists of a source sending information over a two user broadcast channel in presence of two relay nodes that help the transmission to the destinations. Clearly, this network with five nodes…

Information Theory · Computer Science 2010-05-05 Arash Behboodi , Pablo Piantanida

This work studies the capacity of multipath fading channels. A noncoherent channel model is considered, where neither the transmitter nor the receiver is cognizant of the realization of the path gains, but both are cognizant of their…

Information Theory · Computer Science 2009-01-06 Tobias Koch , Amos Lapidoth

In part I, we reviewed how Shannon's classical notion of capacity is not sufficient to characterize a noisy communication channel if the channel is intended to be used as part of a feedback loop to stabilize an unstable scalar linear…

Information Theory · Computer Science 2007-12-06 Anant Sahai , Sanjoy Mitter

Consider a relay cascade, i.e. a network where a source node, a sink node and a certain number of intermediate source/relay nodes are arranged on a line and where adjacent node pairs are connected by error-free (q+1)-ary pipes. Suppose the…

Information Theory · Computer Science 2016-11-17 Tobias Lutz , Christoph Hausl , Ralf Kötter

Reliably transmitting messages despite information loss due to a noisy channel is a core problem of information theory. One of the most important aspects of real world communication, e.g. via wifi, is that it may happen at varying levels of…

Machine Learning · Computer Science 2020-04-02 Karen Ullrich , Fabio Viola , Danilo Jimenez Rezende