Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao https://doi.org/10.1...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
https://doi.org/10.1109/ieeeco...
Article . 2020 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Non-asymptotic Bounds via Causal Coding on Scalar-Valued Gauss-Markov Sources with MSE Distortion and CaSI

Authors: Photios A. Stavrou; Mikael Skoglund;

Non-asymptotic Bounds via Causal Coding on Scalar-Valued Gauss-Markov Sources with MSE Distortion and CaSI

Abstract

We consider a causal source coding problem where a scalar Gauss-Markov source is conveyed through a noiseless communication link subject to a normalized (over time) total MSE distortion constraint. We study the impact of causal side information (CaSI) modeled as a scalar-valued Gaussian process, that is correlated to the source, on the performance of the overall system for two scenarios: (i) when CaSI is available at both the encoder and the decoder, and (ii) when CaSI is available only the decoder. For (i) we derive non-asymptotic lower and upper bounds on the infimum of all achievable normalized (over time) total rates for any fixed finite time horizon. For (ii) we introduce a new "Wyner-Ziv type" lower bound and give conditions for jointly Gaussian processes based on which the lower bound for this setup coincides with the lower bound of (i).

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!