The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
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 extreme points of the Gray-Wyner rate region, which include Wyner's common information, Gåcs-Körner common information and information bottleneck, the rate region...
In this work, we study the problem of two-encoder multiterminal source coding with side information under logarithmic loss distortion measure. We establish a single-letter characterization of the rate-distortion region of this model in the discrete memoryless case. The proof of the converse relies heavily on that of Courtade-Weissman rate-distortion region of the classic two-encoder multiterminal...
This paper studies the fundamental limits of caching in a network with two receivers and two files generated by a two-component discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of equal capacity, and the requested files are delivered over a shared error-free broadcast link. First, a lower bound on the optimal peak rate-memory trade-off is provided...
The rate region of the task-encoding problem for two correlated sources is characterized using a novel parametric family of dependence measures. The converse uses a new expression for the ρ-th moment of the list size, which is derived using the relative α-entropy.
Two kinds of problems, (i) hypothesis testing with many-to-one compression and (ii) one-to-many lossy source coding with side-information at decoders, are investigated in a unified way. It is demonstrated that a simple key idea, which is developed by Iriyama for one-to-one source coding systems, can be applied to multiterminal source coding systems. In particular, general bounds on the error exponents...
The problem of characterizing sufficient conditions for communicating correlated sources over a MAC is considered. The technique of inducing source correlation onto channel inputs [1] is enhanced by the use of fixed B-L coding [2]. The performance of the proposed coding technique is characterized via single-letter expressions to derive a new set of sufficient conditions. The latter conditions are...
The end-to-end delay of streaming source coding is characterized by an age of information (AoI) metric that measures the number of symbol periods the decoder output lags behind the encoder input. The source encoder receives input source symbols one per unit time and sequentially outputs binary codewords to a constant rate channel that transmits bits to the decoder. We examine a system in which knowledge...
We consider the remote source coding setting in which a source realization is estimated from a lossy compressed sequence of noisy observations. Unlike in the optimal remote source coding problem, however, the encoder is bound to use good codes with respect to the observation sequence, i.e., codes that are optimal for the lossy reconstruction of the observation, rather than the remote source. This...
This paper investigates the problem of variable-length lossy source coding. We deal with the case where both the excess distortion probability and the overflow probability of codeword length are less than or equal to positive constants. The infimum of the thresholds on the overflow probability is characterized by a smooth max entropy-based quantity. Both non-asymptotic and asymptotic cases are analyzed...
We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another output is received as side information at the decoder. The adversary is assumed to know the source data non-causally, and can employ randomized jamming strategies...
We study the lossy communication of correlated sources over a multiple access channel (MAC). In particular, we provide a new set of necessary conditions for the achievability of a distortion pair over a given channel. The necessary conditions are then specialized to the case of bivariate Gaussian sources and doubly symmetric binary sources over a Gaussian multiple access channel. Our results indicate...
Motivated by streaming multi-view video coding, we consider the problem of blockwise streaming compression of a pair of correlated sources, which we term streaming Slepian-Wolf coding. We study the moderate deviations regime in which the rate pairs of a sequence of codes converges, along a straight line, to various points on the boundary of the Slepian-Wolf region at a speed slower than the inverse...
Consider a source coding problem in presence of two dependent with memory sources (X, Y), for which only X is available at the encoder (referred to Alice). We first study the design of vector quantization for the situation where one of the source outputs, i.e., X, must be transmitted to the receiver (referred to Bob) within a prescribed distortion tolerance as in ordinary source coding. On the other...
In this paper, we view the problem of receive beamforming in uplink cascade multiple-input multiple-output (MIMO) systems as an instance of that of cascade multiterminal source coding for lossy function computation. Using this connection, we establish two coding schemes for the second and show that their application leads to efficient beamforming schemes for the first. In the first coding scheme,...
Variable-length source coding with side information allowing a nonzero decoding error probability ε is considered. For the case where the side information is available at both of the encoder and decoder, we give an explicit formula of the rate-error function Rc(ε) for the mixture of i.i.d. sources. For the case where the side information is available only at the decoder, we concentrate our attention...
We consider the rate distortion problem with side information at the decoder posed and investigated by Wyner and Ziv. The rate distortion function indicating the trade-off between the rate on the data compression and the quality of data obtained at the decoder was determined by Wyner and Ziv. In this paper, we study the error probability of decoding at rates below the rate distortion function. We...
This paper deals with one-shot fixed-to-variable length source coding allowing error probability. We adopt the criterion of the overflow probability and treat prefix and non-prefix codes. The infimum of the threshold of the overflow probability is investigated under the condition that the error probability and the overflow probability are bounded above by positive constants. We show this threshold...
The paper studies the source coding (quantization) for the feedback of discrete-time and continuous-state cyber-physical systems (CPSs). It is formulated as a sequential coding optimization problem. The goal is to find a deterministic policy, as a series of mappings from the historical state information to the quantization strategy for the current feedback state. In particular, an optimization problem...
Explicit construction of polar codes for the Gray-Wyner network is studied. We show that Wyner's common information plays an essential role in constructing polar codes for both lossless and lossy Gray-Wyner problems. For discrete sources, extracting Wyner's common randomness can be viewed as a lossy compression problem, which is accomplished by extending polar coding from a single source to a pair...
Since their invention in 2009, Polar Codes have emerged as new near-capacity channel codes with a great potential of replacing turbo codes and low density parity check codes in a wide range of applications. This paper investigates the use of systematic polar codes in a distributed source coding application. A system model is proposed for the compression of distributed sources with side information...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.