English
Related papers

Related papers: Outer Bounds for Multiterminal Source Coding via a…

200 papers

We address the problem of delay in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large encoding or decoding delays exist. This phenomena raises the question of just how…

Information Theory · Computer Science 2007-07-13 Ofer Shayevitz , Ram Zamir , Meir Feder

We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent…

Information Theory · Computer Science 2020-08-11 Yasutada Oohama

The error exponent in lossy source coding characterizes the asymptotic decay rate of error probability with respect to blocklength. The Marton's error exponent provides the theoretically optimal bound on this rate. However, computation…

Information Theory · Computer Science 2025-07-29 Jiachuan Ye , Shitong Wu , Lingyi Chen , Wenyi Zhang , Huihui Wu , Hao Wu

The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida

This paper investigates a lossy source coding problem in which two decoders can access their side-information respectively. The correlated sources are a product of two component correlated sources, and we exclusively investigate the case…

Information Theory · Computer Science 2013-05-29 Shun Watanabe

We address the recently suggested problem of causal lossless coding of a randomly arriving source samples. We construct variable-to-fixed coding schemes and show that they outperform the previously considered fixed-to-variable schemes when…

Information Theory · Computer Science 2020-10-27 Uri Abend , Anatoly Khina

The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods:…

Information Theory · Computer Science 2013-05-03 Anelia Somekh-Baruch

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

We study analogue source transmission over MIMO block-fading channels with receiver-only channel state information. Unlike previous work which considers the end-to-end expected distortion as a figure of merit, we study the distortion outage…

Information Theory · Computer Science 2016-11-15 Li Peng , Albert Guillen i Fabregas

Lossy coding of correlated sources over a multiple access channel (MAC) is studied. First, a joint source-channel coding scheme is presented when the decoder has correlated side information. Next, the optimality of separate source and…

Information Theory · Computer Science 2018-06-18 Basak Guler , Deniz Gunduz , Aylin Yener

The distributed index coding problem is studied, whereby multiple messages are stored at different servers to be broadcast to receivers with side information. First, the existing composite coding scheme is enhanced for the centralized…

Information Theory · Computer Science 2017-01-24 Yucheng Liu , Parastoo Sadeghi , Fatemeh Arbabjolfaei , Young-Han Kim

Multifractal analysis of stochastic processes deals with the fine scale properties of the sample paths and seeks for some global scaling property that would enable extracting the so-called spectrum of singularities. In this paper we…

Probability · Mathematics 2014-06-12 Danijel Grahovac , Nikolai N. Leonenko

One of the main theoretical motivations for the emerging area of network coding is the achievability of the max-flow/min-cut rate for single source multicast. This can exceed the rate achievable with routing alone, and is achievable with…

Information Theory · Computer Science 2008-02-04 Terence Chan , Alex Grant

In this work we study zero vs. epsilon-error capacity in network coding instances. For multicast network coding it is well known that all rates that can be delivered with arbitrarily small error probability can also be delivered with zero…

Information Theory · Computer Science 2015-03-19 Michael Langberg , Michelle Effros

Data processing lower bounds on the expected distortion are derived in the finite-alphabet semi-deterministic setting, where the source produces a deterministic, individual sequence, but the channel model is probabilistic, and the decoder…

Information Theory · Computer Science 2016-11-17 Neri Merhav

Despite the impressive quality improvements yielded by neural machine translation (NMT) systems, controlling their translation output to adhere to user-provided terminology constraints remains an open problem. We describe our approach to…

Computation and Language · Computer Science 2018-05-11 Eva Hasler , Adrià De Gispert , Gonzalo Iglesias , Bill Byrne

We study the problem of secure joint source-channel coding for multimodal semantic sources transmitted over noisy wiretap channels. The source model consists of $m$ modalities (e.g., image, audio, and sensor data), all represented as random…

Information Theory · Computer Science 2026-05-26 Denis Kozlov , Mahtab Mirmohseni , Rahim Tafazolli

In this paper, we consider a distributed remote source coding problem, where a sequence of observations of source vectors is available at the encoder. The problem is to specify the optimal rate for encoding the observations subject to a…

Information Theory · Computer Science 2014-06-05 Adel Zahedi , Jan Ostergaard , Soren Holdt Jensen , Patrick Naylor , Soren Bech

We revisit the Gray-Wyner lossy source coding problem and derive the first-order asymptotic optimal rate-distortion-perception region when additional perception constraints are imposed on reproduced source sequences. The optimal trade-off…

Information Theory · Computer Science 2026-01-19 Yu Yang , Yingxin Zhang , Weijie Yuan , Lin Zhou

Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…

Information Theory · Computer Science 2013-11-25 Ryul Kim , Myong-Son Sin , Ok-Hyon Song