DocumentCode
938572
Title
Fixed-rate encoding of individual sequences with side information
Author
Ziv, Jacob
Volume
30
Issue
2
fYear
1984
fDate
3/1/1984 12:00:00 AM
Firstpage
348
Lastpage
352
Abstract
For every infinite sequence
and a given side-information sequence
, we define a quality
called the finite-state conditional complexity of
given
. It is shown that
is the smallest asymptotically attainable fixed-rate at which
can be transmitted with negligibly small distortion, given
. Moreover, it is demonstrated that in order to achieve an arbitrary small distortion for all sequences such that
is less than the allowable transmission rate it is not necessary for the encoder to have access to the side-information sequence
(provided it is available to the decoder). This result is a generalization of the classical Slepian-Wolf result for cases where the probabilistic characterization of
and
is not known, or does not exist.
and a given side-information sequence
, we define a quality
called the finite-state conditional complexity of
given
. It is shown that
is the smallest asymptotically attainable fixed-rate at which
can be transmitted with negligibly small distortion, given
. Moreover, it is demonstrated that in order to achieve an arbitrary small distortion for all sequences such that
is less than the allowable transmission rate it is not necessary for the encoder to have access to the side-information sequence
(provided it is available to the decoder). This result is a generalization of the classical Slepian-Wolf result for cases where the probabilistic characterization of
and
is not known, or does not exist.Keywords
Source coding; Codes; Convergence; Decoding; Encoding; Entropy; Jacobian matrices; Quantization; Source coding; Stochastic processes; Telephony;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1984.1056878
Filename
1056878
Link To Document