Achievable Rate Regions for Source Coding with Delayed Partial Side Information

In this paper, we consider a source coding with side information partially used at the decoder through a codeword. We assume that there exists a relative delay (or gap) of the correlation between the source sequence and side information. We also assume that the delay is unknown but the maximum of po...

Full description

Saved in:
Bibliographic Details
Published in:2018 International Symposium on Information Theory and Its Applications (ISITA) pp. 369 - 373
Main Authors: Matsuta, Tetsunao, Uyematsu, Tomohiko
Format: Conference Proceeding
Language:English
Published: IEICE 01.10.2018
Subjects:
Correlation
Decoding
Delays
Error probability
Manganese
Source coding
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we consider a source coding with side information partially used at the decoder through a codeword. We assume that there exists a relative delay (or gap) of the correlation between the source sequence and side information. We also assume that the delay is unknown but the maximum of possible delays is known to two encoders and the decoder, where we allow the maximum of delays to be subject to change by the block length. In this source coding, we give an inner bound and an outer bound on the achievable rate region, where the achievable rate region is the set of rate pairs of encoders such that the decoding error probability vanishes as the block length tends to infinity. Furthermore, we clarify that the inner bound coincides with the outer bound when the maximum of delays for the block length converges to a constant.
DOI:10.23919/ISITA.2018.8664229