Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem

Tetsunao MATSUTA  Tomohiko UYEMATSU  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E101-A   No.12   pp.2110-2124
Publication Date: 2018/12/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E101.A.2110
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Shannon theory
Keyword: 
general source,  information spectrum,  non-asymptotic bound,  rate-distortion region,  successive refinement,  

Full Text: PDF(804.7KB)
>>Buy this Article


Summary: 
In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by one of two codewords, and the other reconstruction is obtained by all two codewords. For this coding problem, we give non-asymptotic inner and outer bounds on pairs of numbers of codewords of two encoders such that each probability that a distortion exceeds a given distortion level is less than a given probability level. We also give a general formula for the rate-distortion region for general sources, where the rate-distortion region is the set of rate pairs of two encoders such that each maximum value of possible distortions is less than a given distortion level.