English
Related papers

Related papers: Asynchronous Communication: Capacity Bounds and Su…

200 papers

Network capacity region is an important character of mobile ad hoc networks. Using cell-partitioned model, an expression of upper bound of delay-tolerant hybrid mobile ad hoc network is deduced regardless of coverage of base stations, types…

Networking and Internet Architecture · Computer Science 2014-04-08 Hu Li , Yuan`an Liu , Hefei Hu , Dongming Yuan , Sirui Duan

Quantum network is the key to enable distributed quantum information processing. As the single-link communication rate decays exponentially with the distance, to enable reliable end-to-end quantum communication, the number of nodes needs to…

Quantum Physics · Physics 2021-08-17 Quntao Zhuang , Bingzhi Zhang

The role of synchronous firing in sensory coding and cognition remains controversial. While studies, focusing on its mechanistic consequences in attentional tasks, suggest that synchronization dynamically boosts sensory processing, others…

Neurons and Cognition · Quantitative Biology 2019-05-07 Siavash Ghavami , Vahid Rahmati , Farshad Lahouti , Lars Schwabe

Information must take up space, must weigh, and its flux must be limited. Quantum limits on communication and information storage leading to these conclusions are here described. Quantum channel capacity theory is reviewed for both steady…

Quantum Physics · Physics 2015-06-26 Jacob D. Bekenstein , Marcelo Schiffer

It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position…

Information Theory · Computer Science 2007-07-13 Anant Sahai

In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the combinatorial setting where the maximum number of errors inflicted by an adversary is proportional to the number of transmissions,…

Information Theory · Computer Science 2021-02-11 Christian Deppe , Vladimir Lebedev , Georg Maringer , Nikita Polyanskii

The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiver for a fixed rate of transmission. Most prior work on finding the transmission capacity…

Information Theory · Computer Science 2010-09-09 Rahul Vaze , Kien T. Truong , Steven Weber , Robert W. Heath

Over the recent years, the proliferation of smart devices and their applications has led to a rapid evolution of the concept of the Internet of Things (IoT), advancing large scale machine type networks which are characterized by sporadic…

Signal Processing · Electrical Eng. & Systems 2019-03-27 Eleni Demarchou , Constantinos Psomas , Ioannis Krikidis

We consider stability of scheduled multiaccess message communication with random coding and joint maximum-likehood decoding of messages. The framework we consider here models both the random message arrivals and the subsequent reliable…

Information Theory · Computer Science 2007-07-13 KCV Kalyanarama Sesha Sayee , Utpal Mukherji

Traditional asymptotic information-theoretic studies of the fundamental limits of wireless communication systems primarily rely on some ideal assumptions, such as infinite blocklength and vanishing error probability. While these assumptions…

Information Theory · Computer Science 2025-12-29 Junyuan Gao , Shuao Chen , Yongpeng Wu , Liang Liu , Giuseppe Caire , H. Vincent Poor , Wenjun Zhang

The problem of communication and state estimation is considered in the context of channels with actiondependent states. Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the…

Information Theory · Computer Science 2012-02-07 Chiranjib Choudhuri , Urbashi Mitra

The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…

Information Theory · Computer Science 2018-10-30 Pinar Sen , Sung Hoon Lim , Young-Han Kim

We consider the problem of authenticated communication over a discrete arbitrarily varying channel where the legitimate parties are unaware of whether or not an adversary is present. When there is no adversary, the channel state always…

Information Theory · Computer Science 2023-05-15 Mayank Bakshi , Oliver Kosut

This paper studies the performance of a feedback control loop closed via an error-free digital communication channel with transmission delay. The system comprises a discrete-time noisy linear time-invariant (LTI) plant whose single…

Systems and Control · Computer Science 2018-09-05 M. Barforooshan , M. S. Derpich , P. A. Stavrou , J. Østergaard

Consider an energy-harvesting receiver that uses the same received signal both for decoding information and for harvesting energy, which is employed to power its circuitry. In the scenario where the receiver has limited battery size, a…

Information Theory · Computer Science 2015-06-02 Anshoo Tandon , Mehul Motani , Lav R. Varshney

Feedback control actively dissipates uncertainty from a dynamical system by means of actuation. We develop a notion of "control capacity" that gives a fundamental limit (in bits) on the rate at which a controller can dissipate the…

Information Theory · Computer Science 2017-01-17 Gireeja Ranade , Anant Sahai

Analytic, first-principles performance modeling of distributed-memory parallel codes is notoriously imprecise. Even for applications with extremely regular and homogeneous compute-communicate phases, simply adding communication time to…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-25 Ayesha Afzal , Georg Hager , Gerhard Wellein

A communication setup is considered where a transmitter wishes to simultaneously sense its channel state and convey a message to a receiver. The state is estimated at the transmitter by means of generalized feedback, i.e. a strictly causal…

Information Theory · Computer Science 2018-05-16 Mari Kobayashi , Giuseppe Caire , Gerhard Kramer

This paper considers the three-way channel, consisting of three nodes, where each node broadcasts a message to the two other nodes. The capacity of the finite-field three-way channel is derived, and is shown to be achievable using a…

Information Theory · Computer Science 2013-01-11 Lawrence Ong

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