English
Related papers

Related papers: On Cooperation in Multi-Terminal Computation and R…

200 papers

We extend quantum rate distortion theory by considering auxiliary resources that might be available to a sender and receiver performing lossy quantum data compression. The first setting we consider is that of quantum rate distortion coding…

Quantum Physics · Physics 2013-12-09 Mark M. Wilde , Nilanjana Datta , Min-Hsiu Hsieh , Andreas Winter

In this work, we investigate an instance of the Heegard-Berger problem with two sources and arbitrarily correlated side information sequences at two decoders, in which the reconstruction sets at the decoders are degraded. Specifically, two…

Information Theory · Computer Science 2015-08-27 Meryem Benammar , Abdellatif Zaidi

The state-dependent memoryless channel (SDMC) is employed to model the integrated sensing and communication (ISAC) system, where the transmitter conveys messages to the receiver while simultaneously estimating the state parameter of…

Information Theory · Computer Science 2026-01-14 Lugaoze Feng , Guocheng Lv , Xunan Li , Ye Jin

This paper takes a rate-distortion approach to understanding the information-theoretic laws governing cache-aided communications systems. Specifically, we characterise the optimal tradeoffs between the delivery rate, cache capacity and…

Information Theory · Computer Science 2016-10-25 Roy Timo , Shirin Saeedi Bidokhti , Michèle Wigger , Bernhard C. Geiger

We study the problem of rate-distortion-equivocation with side-information only available at the decoder when an independent private random key is shared between the sender and the receiver. The sender compresses the sequence, and the…

Information Theory · Computer Science 2022-01-25 Hamid Ghourchian , Photios A. Stavrou , Tobias J. Oechtering , Mikael Skoglund

We extend the Rate-Distortion-Perception (RDP) framework to the R\'enyi information-theoretic regime, utilizing Sibson's $\alpha$-mutual information to characterize the fundamental limits under distortion and perception constraints. For…

Information Theory · Computer Science 2026-05-12 Jiahui Wei , Marios Kountouris

The work at hand presents a finite-blocklength analysis of the multiple access channel (MAC) sum-rate under the cooperation facilitator (CF) model. The CF model, in which independent encoders coordinate through an intermediary node, is…

Information Theory · Computer Science 2021-02-03 Oliver Kosut , Michelle Effros , Michael Langberg

Capacity improvement from transmitter and receiver cooperation is investigated in a two-transmitter, two-receiver network with phase fading and full channel state information available at all terminals. The transmitters cooperate by first…

Information Theory · Computer Science 2016-11-17 Chris T. K. Ng , Nihar Jindal , Andrea J. Goldsmith , Urbashi Mitra

A two-terminal interactive function computation problem with alternating messages is studied within the framework of distributed block source coding theory. For any finite number of messages, a single-letter characterization of the…

Information Theory · Computer Science 2012-08-06 Nan Ma , Prakash Ishwar

Computing the rate-distortion function for continuous sources is commonly regarded as a standard continuous optimization problem. When numerically addressing this problem, a typical approach involves discretizing the source space and…

Information Theory · Computer Science 2024-05-02 Lingyi Chen , Shitong Wu , Wenyi Zhang , Huihui Wu , Hao Wu

In the area of basic and network coded cooperative communication, the expected end-to-end bit error rate (BER) values are frequently required to compare the proposed coding, relaying, and decoding techniques. Instead of obtaining these…

Information Theory · Computer Science 2013-12-06 Tugcan Aktas , A. Ozgur Yilmaz , Emre Aktas

We consider the problem of multiple description scalar quantizers and describing the achievable rate-distortion tuples in that setting. We formulate it as a combinatorial optimization problem of arranging numbers in a matrix to minimize the…

Data Structures and Algorithms · Computer Science 2007-05-23 Tanya Y. Berger-Wolf , Edward M. Reingold

In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…

Information Theory · Computer Science 2020-10-21 Farhad Shirani , S. Sandeep Pradhan

A communication setup is considered where a transmitter wishes to convey a message to a receiver and simultaneously estimates the state of that receiver through a common waveform. The state is estimated at the transmitter by means of…

Information Theory · Computer Science 2022-06-03 Mehrasa Ahmadipour , Mari Kobayashi , Miche`le Wigger , Giuseppe Caire

Consider a source that produces independent copies of a triplet of jointly distributed random variables, $\{X_{i},Y_{i},Z_{i}\}_{i=1}^{\infty}$. The process $\{X_{i}\}$ is observed at the encoder, and is supposed to be reproduced at two…

Information Theory · Computer Science 2008-12-18 Alina Maor , Neri Merhav

An intuitive outer bound for the multiterminal source coding problem is given. The proposed bound explicitly couples the rate distortion functions for each source and correlation measures which derive from a "strong" data processing…

Information Theory · Computer Science 2013-07-17 Thomas A. Courtade

The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel with an arbitrary number of channel states. The…

Information Theory · Computer Science 2011-02-02 Moritz Wiese , Holger Boche , Igor Bjelaković , Volker Jungnickel

In some rate-distortion-type problems, the required fidelity of information is affected by past actions. As a result, the distortion function depends not only on the instantaneous distortion between a source symbol and its representation…

Information Theory · Computer Science 2026-01-30 Hamidreza Abin , Amin Gohari , Andrew W. Eckford

We consider the problem of distributed computation of a target function over a multiple-access channel. If the target and channel functions are matched (i.e., compute the same function), significant performance gains can be obtained by…

Information Theory · Computer Science 2013-03-28 Nikhil Karamchandani , Urs Niesen , Suhas Diggavi

Classical information theory typically assumes reliable receiver-side processing. We study remote inference when communication is noisy and the receiver itself is built from unreliable components under a finite redundancy budget. Under a…

Information Theory · Computer Science 2026-04-22 Zhenyu Liu , Yi Ma , Rahim Tafazolli