Coding With Action-Dependent Side Information and Additional Reconstruction Requirements

Two classes of source/channel coding problems, namely, coding with action-dependent side information and coding with additional signal reconstruction are considered in a unified fashion. In the source coding setting, a decoder wishes to reconstruct the source subject to a distortion constraint, whil...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on information theory Ročník 61; číslo 11; s. 6355 - 6367
Hlavní autori: Kittichokechai, Kittipong, Oechtering, Tobias J., Skoglund, Mikael
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.11.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Action
Channel coding
channel with states
Channels
Coders
Coding
Coding theory
Correlation analysis
Decoders
Decoding
Distortion
duality
Encoders
Information theory
Messages
Rate-distortion
Reconstruction
signal reconstruction
Source coding
source coding with side information
Symmetry
Tin
signal reconstruction
Action
source coding with side information
channel with states
duality
ISSN:0018-9448, 1557-9654, 1557-9654
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Two classes of source/channel coding problems, namely, coding with action-dependent side information and coding with additional signal reconstruction are considered in a unified fashion. In the source coding setting, a decoder wishes to reconstruct the source subject to a distortion constraint, while an encoder is required to estimate the decoder's reconstruction reliably. Side information is action-dependent in the sense that its quality and/or availability at the encoder or decoder can be influenced by a cost-constrained action sequence. In the channel coding dual, the decoder wishes to decode both the message and the channel input sequence reliably, and the channel state information available at the encoder or decoder is assumed to depend on the action sequence. We consider discrete memoryless systems and characterize single letter expressions for the rate-distortion-cost function and channel capacity for the respective source and channel coding problems.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0018-9448
1557-9654
1557-9654
DOI:10.1109/TIT.2015.2476800