DocumentCode
2885232
Title
Compression with actions
Author
Zhao, Lei ; Chia, Yeow-Kiang ; Weissman, Tsachy
Author_Institution
Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
fYear
2011
fDate
28-30 Sept. 2011
Firstpage
164
Lastpage
171
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.
Keywords
binary sequences; channel coding; achievability; action encoder; lossless compression; optimal channel coding strategy; optimal modified sequence; state sequence; Decoding; Encoding; Indexes; Robots; Silicon; Tin; Zinc;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on
Conference_Location
Monticello, IL
Print_ISBN
978-1-4577-1817-5
Type
conf
DOI
10.1109/Allerton.2011.6120164
Filename
6120164
Link To Document