vix.ing · top · new · best · stats · spec

Common Reconstructions in the Successive Refinement Problem with\n Receiver Side Information

2016/11/16 by Badri N. Vellambi, Vellambi, Badri N., Roy Timo +1
Engineering · #FOS: Computer and information sciences #Geophysical Methods and Applications #Information Theory (cs.IT) #Microwave Imaging and Scattering Analysis #Sparse and Compressive Sensing Techniques

paper · pdf · doi:10.48550/arxiv.1611.05467

openalex publication_date 2016/11/16 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28

Abstract

We study a variant of the successive refinement problem with receiver side\ninformation where the receivers require identical reconstructions. We present\ngeneral inner and outer bounds for the rate region for this variant and present\na single-letter characterization of the admissible rate region for several\nclasses of the joint distribution of the source and the side information. The\ncharacterization indicates that the side information can be fully used to\nreduce the communication rates via binning; however, the reconstruction\nfunctions can depend only on the G 'acs-K "orner common randomness shared by\nthe two receivers. Unlike existing (inner and outer) bounds to the rate region\nof the general successive refinement problem, the characterization of the\nadmissible rate region derived for several settings of the variant studied\nrequires only one auxiliary random variable. Using the derived\ncharacterization, we establish that the admissible rate region is not\ncontinuous in the underlying source source distribution even though the problem\nformulation does not involve zero-error or functional reconstruction\nconstraints.\n

Related