English
Related papers

Related papers: Semi-constrained Systems

200 papers

Semiconstrained systems were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply…

Information Theory · Computer Science 2016-10-25 Ohad Elishco , Tom Meyerovitch , Moshe Schwartz

Two types of noise-free relay cascades are investigated. Networks where a source communicates with a distant receiver via a cascade of half-duplex constrained relays, and networks where not only the source but also a single relay node…

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

Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained system is limited by the combinatorial capacity of the system…

Information Theory · Computer Science 2008-09-09 Georg Böcherer , Valdemar Cardoso da Rocha , Cecilio Pimentel

We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal…

Information Theory · Computer Science 2022-05-31 Allison Beemer , Altan Berdan Kilic , Alberto Ravagnani

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

This paper considers the problem of stabilizing a discrete-time non-linear stochastic system over a finite capacity noiseless channel. Our focus is on systems which decompose into a stable and unstable component, and the stability notion…

Optimization and Control · Mathematics 2021-09-07 Nicolás Garcia , Christoph Kawan , Serdar Yüksel

A restricted two-way communication problem in a small fully-connected network is investigated. The network consists of three nodes, all having access to a common channel with half-duplex constraint. Two nodes want to establish a dialog…

Information Theory · Computer Science 2014-09-05 Manuel Stein

We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…

Information Theory · Computer Science 2021-09-29 Neri Merhav

A joint communication and channel state estimation problem is investigated, in which reliable information transmission over a noisy channel, and high-fidelity estimation of the channel state, are simultaneously sought. The tradeoff between…

Information Theory · Computer Science 2008-01-09 Wenyi Zhang , Satish Vedantam , Urbashi Mitra

Shannon's theory of zero-error communication is re-examined in the broader setting of using one classical channel to simulate another exactly, and in the presence of various resources that are all classes of non-signalling correlations:…

Quantum Physics · Physics 2016-11-17 Toby S. Cubitt , Debbie Leung , William Matthews , Andreas Winter

We find a new formula for the limit of the capacity of certain sequences of multidimensional semiconstrained systems as the dimension tends to infinity. We do so by generalizing the notion of independence entropy, originally studied in the…

Dynamical Systems · Mathematics 2017-09-19 Ohad Elishco , Tom Meyerovitch , Moshe Schwartz

This paper studies the shuffling phase in a distributed computing model with rate-limited links between nodes. Each node is connected to all other nodes via a noiseless broadcast link with a finite capacity. For this network, the shuffling…

Information Theory · Computer Science 2024-05-07 Shanuja Sasi , Onur Günlü

Rodrigo de Miguel et al 2007 J. Phys. A: Math. Theor. 40 5241-5260: A noisy vector channel operating under a strict complexity constraint at the receiver is introduced. According to this constraint, detected bits, obtained by performing…

Information Theory · Computer Science 2009-11-11 Rodrigo de Miguel , Ori Shental , Ralf R. Muller , Ido Kanter

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

An upper limit is given to the amount of quantum information that can be transmitted reliably down a noisy, decoherent quantum channel. A class of quantum error-correcting codes is presented that allow the information transmitted to attain…

Quantum Physics · Physics 2009-10-30 Seth Lloyd

Shannon's channel coding theorem describes the maximum possible rate of reliable information transfer through a classical noisy communication channel. It, together with the source coding theorem, characterizes lossless channel communication…

Quantum Physics · Physics 2021-05-17 Sristy Agrawal , Rajashik Tarafder , Graeme Smith , Arup Roy , Manik Banik

The Shannon upper bound places a limit on the error-free information transmission rate (capacity) of a noisy channel. It has stood for over sixty years, and underlies both theoretical and practical work in the telecommunications industry.…

Information Theory · Computer Science 2017-05-08 Jon Montalban , Jon Barrueco , Pablo Angueira , Jerrold D. Prothero

We consider the problem of controlling marginally stable linear systems using bounded control inputs for networked control settings in which the communication channel between the remote controller and the system is unreliable. We assume…

Optimization and Control · Mathematics 2010-04-07 Debasish Chatterjee , Saurabh Amin , Peter Hokayem , John Lygeros , S. Shankar Sastry

In this paper, protocols for the half-duplex relay channel are introduced and performance limits are analyzed. Relay nodes underly an orthogonality constraint, which prohibits simultaneous receiving and transmitting on the same…

Information Theory · Computer Science 2010-02-02 Peter Rost , Gerhard Fettweis

We formulate a model for intermittent communication that can capture bursty transmissions or a sporadically available channel, where in either case the receiver does not know a priori when the transmissions will occur. Focusing on the…

Information Theory · Computer Science 2017-03-20 Mostafa Khoshnevisan , J Nicholas Laneman
‹ Prev 1 2 3 10 Next ›