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.
In this paper we consider the separate coding problem for L+1 correlated Gaussian memoryless sources. We deal with the case where L separately encoded data of sources work as side information at the decoder for the reconstruction of the remaining source. The determination problem of the rate distortion region for this system is the so called many-help-one problem and has been known as a highly challenging...
We describe a scheme for rate-distortion with distributed encoding in which the sources to be compressed contain a common component. We show that this scheme is optimal in some situations and that it strictly improves upon existing schemes, which do not make full use of common components. This resolves in the negative an open question regarding whether independent quantization followed by independent...
We consider a binary erasure version of the n-channel multiple descriptions problem with no excess rate and no distortion for every k out of n descriptions, i.e., any subset of k messages has a total rate of one and allows for perfect reconstruction of the source. We present an achievability scheme and characterize its distortion when m < k messages are received at the decoder. We show that the...
We propose a new coding scheme for the symmetric K-channel multiple description problem based on the quantization splitting technique, which was previously successfully applied to the Gaussian CEO problem. Unlike a coding scheme we discovered earlier, the scheme proposed here can provide performance better than the one by Pradhan, Puri and Ramchandran in a component-wise manner. Though the method...
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.