Rate Region of the One-Help-Two Quadratic Gaussian Source-Coding Problem with Markovity

We study the quadratic Gaussian one-help-two source-coding problem with Markovity, in which three encoders separately encode the components of a memoryless vector-Gaussian source that form a Markov chain and the central decoder aims to reproduce the first and the second components in the chain subje...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 69; no. 3; p. 1
Main Authors: Bilgen, Omer, Wagner, Aaron B.
Format: Journal Article
Language:English
Published: New York IEEE 01.03.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Coders
Coding
Covariance matrices
Decoding
Distortion
distributed compression
Encoding
Gaussian sources
Markov chains
Markov processes
Multiterminal source-coding
network information theory
one-help-two problem
Random variables
Rate-distortion
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the quadratic Gaussian one-help-two source-coding problem with Markovity, in which three encoders separately encode the components of a memoryless vector-Gaussian source that form a Markov chain and the central decoder aims to reproduce the first and the second components in the chain subject to individual mean-squared distortion constraints. We determine the rate region under a high-resolution assumption for the middle source.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2022.3214433