English
Related papers

Related papers: Second-Order Region for Gray-Wyner Network

200 papers

In this paper, we revisit the discrete lossy Gray-Wyner problem. In particular, we derive its optimal second-order coding rate region, its error exponent (reliability function) and its moderate deviations constant under mild conditions on…

Information Theory · Computer Science 2017-01-05 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

We propose a framework for second-order achievability, called type deviation convergence, that is generally applicable to settings in network information theory, and is especially suitable for lossy source coding and channel coding with…

Information Theory · Computer Science 2025-10-24 Xiang Li , Cheuk Ting Li

We establish the rate region of an extended Gray-Wyner system for 2-DMS $(X,Y)$ with two additional decoders having complementary causal side information. This extension is interesting because in addition to the operationally significant…

Information Theory · Computer Science 2018-12-11 Cheuk Ting Li , Abbas El Gamal

We derive the optimal second-order coding region and moderate deviations constant for successive refinement source coding with a joint excess-distortion probability constraint. We consider two scenarios: (i) a discrete memoryless source…

Information Theory · Computer Science 2016-08-29 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

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

We presented assisted common information as a generalization of G\'acs-K\"orner (GK) common information at ISIT 2010. The motivation for our formulation was to improve upperbounds on the efficiency of protocols for secure two-party sampling…

Information Theory · Computer Science 2016-11-15 Vinod M. Prabhakaran , Manoj M. Prabhakaran

The paper derives the optimal second-order coding rate for the continuous-time Poisson channel. We also obtain bounds on the third-order coding rate. This is the first instance of a second-order result for a continuous-time channel. The…

Information Theory · Computer Science 2020-08-18 Yuta Sakai , Vincent Y. F. Tan , Mladen Kovačević

Since the publication of Shannon's theory of one terminal source coding, a number of interesting extensions have been derived by researchers such as Slepian-Wolf, Wyner, Ahlswede-K\"{o}rner, Wyner-Ziv and Berger-Yeung. Specifically, the…

Information Theory · Computer Science 2007-07-13 Soumya Jana

The second-order achievable rate region in Slepian-Wolf source coding systems is investigated. The concept of second-order achievable rates, which enables us to make a finer evaluation of achievable rates, has already been introduced and…

Information Theory · Computer Science 2017-03-28 Ryo Nomura , Te Sun Han

In the first paper of this two part communication, we solved in a unified framework a variety of two terminal source coding problems with noncooperative encoders, thereby consolidating works of Shannon, Slepian-Wolf, Wyner,…

Information Theory · Computer Science 2007-07-13 Soumya Jana

We consider the problem of source coding subject to a fidelity criterion for the Gray-Wyner network that connects a single source with two receivers via a common channel and two private channels. The pareto-optimal trade-offs between the…

Information Theory · Computer Science 2020-10-01 Erixhen Sula , Michael Gastpar

We investigate the problem of the successive refinement for Wyner-Ziv coding with degraded side information and obtain a complete characterization of the rate region for the quadratic vector Gaussian case. The achievability part is based on…

Information Theory · Computer Science 2020-02-19 Yinfei Xu , Xuan Guang , Jian Lu , Jun Chen

This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of…

Information Theory · Computer Science 2014-11-18 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

Consider the following information theoretic setup wherein independent codebooks of N correlated random variables are generated according to their respective marginals. The problem of determining the conditions on the rates of codebooks to…

Information Theory · Computer Science 2012-05-08 Kumar Viswanatha , Emrah Akyol , Kenneth Rose

We present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include (i) the Wyner-Ahlswede-Korner (WAK) problem of almost-lossless source coding with…

Information Theory · Computer Science 2014-12-30 Shun Watanabe , Shigeaki Kuzuoka , Vincent Y. F. Tan

Consider the two-way rate-distortion problem in which a helper sends a common limited-rate message to both users based on side information at its disposal. We characterize the region of achievable rates and distortions where a Markov form…

Information Theory · Computer Science 2009-04-06 Haim Permuter , Yossi Steinberg , Tsachy Weissman

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

The last decade has witnessed an increase of interest in the spatial analysis of structured point patterns over networks whose analysis is challenging because of geometrical complexities and unique methodological problems. In this context,…

Methodology · Statistics 2017-12-06 Matthias Eckardt , Jorge Mateu

A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region…

Information Theory · Computer Science 2010-04-20 Shigeaki Kuzuoka , Akisato Kimura , Tomohiko Uyematsu

This paper studies second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and…

Information Theory · Computer Science 2013-11-13 Jonathan Scarlett
‹ Prev 1 2 3 10 Next ›