Photo by ldxcreative from unsplash
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… Click to show full abstract
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.
Keywords:
coding problem;
source coding;
source;
quadratic gaussian;
one help;
help two
Journal Title: IEEE Transactions on Information Theory
Year Published: 2023
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: IEEE Transactions on Information Theory
Year Published: 2023
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!