pith. sign in

arxiv: 1204.2331 · v1 · pith:ETTL5MNMnew · submitted 2012-04-11 · 💻 cs.IT · math.IT

Compression with Actions

classification 💻 cs.IT math.IT
keywords sequenceactionschannelcompressionoptimalstateachievabilityaction
0
0 comments X
read the original abstract

We consider the setting where actions can be used to modify a state sequence before compression. The minimum rate needed to losslessly describe the optimal modified sequence is characterized when the state sequence is either non-causally or causally available at the action encoder. The achievability is closely related to the optimal channel coding strategy for channel with states. We also extend the analysis to the the lossy case.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.