English
Related papers

Related papers: Semi-constrained Systems

200 papers

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

Consider a control problem with a communication channel connecting the observer of a linear stochastic system to the controller. The goal of the controller is to minimize a quadratic cost function in the state variables and control signal,…

Information Theory · Computer Science 2018-11-27 Victoria Kostina , Babak Hassibi

This paper considers rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors…

Information Theory · Computer Science 2013-01-15 Wentao Huang , Tracey Ho , Hongyi Yao , Sidharth Jaggi

This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input single-output (SISO) relay channels, MIMO relay channels introduce additional degrees of…

Information Theory · Computer Science 2008-05-03 Caleb K. Lo , Sriram Vishwanath , Robert W. Heath

For the additive Gaussian noise channel with average codeword power constraint, sparse superposition codes and adaptive successive decoding is developed. Codewords are linear combinations of subsets of vectors, with the message indexed by…

Information Theory · Computer Science 2010-06-22 Andrew R Barron , Antony Joseph

An upper bound on the capacity of a cascade of nonlinear and noisy channels is presented. The cascade mimics the split-step Fourier method for computing waveform propagation governed by the stochastic generalized nonlinear Schroedinger…

Information Theory · Computer Science 2015-04-24 Gerhard Kramer , Mansoor I. Yousefi , Frank R. Kschischang

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error…

Information Theory · Computer Science 2021-02-16 Ehsan Asadi Kangarshahi , Albert Guillén i Fàbregas

The interactive capacity of a noisy channel is the highest possible rate at which arbitrary interactive protocols can be simulated reliably over the channel. Determining the interactive capacity is notoriously difficult, and the best known…

Information Theory · Computer Science 2021-02-03 Assaf Ben-Yishai , Young-Han Kim , Rotem Oshman , Ofer Shayevitz

As conventional communication systems based on classic information theory have closely approached the limits of Shannon channel capacity, semantic communication has been recognized as a key enabling technology for the further improvement of…

Information Theory · Computer Science 2023-06-06 Jiancheng Tang , Qianqian Yang , Zhaoyang Zhang

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…

Information Theory · Computer Science 2016-11-15 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

Recently, a secrecy measure based on list-reconstruction has been proposed [2], in which a wiretapper is allowed to produce a list of $2^{mR_{L}}$ reconstruction sequences and the secrecy is measured by the minimum distortion over the…

Information Theory · Computer Science 2017-07-25 Lei Yu , Houqiang Li , Weiping Li

An arbitrarily reliable quantum computer can be efficiently constructed from noisy components using a recursive simulation procedure, provided that those components fail with probability less than the fault-tolerance threshold. Recent…

Quantum Physics · Physics 2013-04-03 K. M. Svore , A. W. Cross , I. L. Chuang , A. V. Aho

In this paper, firstly, the Shannon channel capacity formula is briefly stated, and the relationship between the formula and the signal uncertainty principle is analyzed in order to prepare for deriving the formula which is able to break…

Information Theory · Computer Science 2020-04-28 Dequn Liang , Xinyu Dou

Analytic combinatorics in several variables is a branch of mathematics that deals with deriving the asymptotic behavior of combinatorial quantities by analyzing multivariate generating functions. We study information-theoretic questions…

Information Theory · Computer Science 2025-07-16 Andreas Lenz , Stephen Melczer , Cyrus Rashtchian , Paul H. Siegel

We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication…

Information Theory · Computer Science 2020-01-10 Yihan Zhang , Shashank Vatedka , Sidharth Jaggi

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

The traditional communication model based on chain of multiple independent processing blocks is constraint to efficiency and introduces artificial barriers. Thus, each individually optimized block does not guarantee end-to-end performance…

Machine Learning · Computer Science 2022-04-11 Ijaz Ahmad , Seokjoo Shin

A new approach to the problem of error correction in communication channels is proposed, in which the input sequence is transformed in such a way that the interdependence of symbols is significantly increased. Then, after the sequence is…

Information Theory · Computer Science 2026-01-13 Boris Ryabko

In these series of multi-part papers, a systematic study of fundamental limits of communications in interference networks is established. Here, interference network is referred to as a general single-hop communication scenario with…

Information Theory · Computer Science 2013-02-18 Reza K. Farsani