Source and channel coding with action-dependent partially known two-sided state information

Kittichokechai, Kittipong; Oechtering, Tobias J.; Skoglund, Mikael; Thobaben, Ragnar

doi:10.1109/isit.2010.5513554

Cited by 16 publications

(19 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We can also show that the CR sum-rate distortion and cost function expressed in (1) is convex and non-increasing in D and C. (The proof is similar to that in [5] and [6]. )…”

Section: Theoremmentioning

confidence: 69%

Source coding with common reconstruction and action-dependent side information

Kittichokechai

Oechtering

Skoglund

2010

2010 IEEE Information Theory Workshop

Self Cite

View full text Add to dashboard Cite

We determine the rate region of a source coding problem with common reconstruction and action-dependent side information where an action sequence is taken by an encoder over a rate-limited link. We show that the rate region depends only on the sum-rate and the sum-rate distortion and cost function is characterized. The result serves as a fundamental limit in transmission scenarios where the encoder wants to control and monitor the quality of the decoder's reconstruction via the respective uses of action sequences and a common reconstruction constraint.

show abstract

“…We can also show that the CR sum-rate distortion and cost function expressed in (1) is convex and non-increasing in D and C. (The proof is similar to that in [5] and [6]. )…”

Section: Theoremmentioning

confidence: 69%

Source coding with common reconstruction and action-dependent side information

Kittichokechai

Oechtering

Skoglund

2010

2010 IEEE Information Theory Workshop

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [7], the availability of the states at the encoder is controlled by a probing (action) signal, which is subject to a cost constraint. Similar action-dependent ideas were studied in [8] in the source coding context. However, the models studied in [6], [7] and [8] do not incorporate any secrecy constraints.…”

Section: A Related Workmentioning

confidence: 79%

“…Similar action-dependent ideas were studied in [8] in the source coding context. However, the models studied in [6], [7] and [8] do not incorporate any secrecy constraints.…”

Section: A Related Workmentioning

confidence: 79%

“…where (a) is due to Fano's inequality (ϵ n → 0 as n → ∞), (b) is due to the secrecy condition (3), (c) by applying Lemma 5, (d) follows from defining the auxiliary random variable W i (Y i−1 , Z n i+1 , Φ), (e) follows by defining the auxiliary random variables (7) and (8). Finally, by using the definition and concavity of C SK (Γ) (see Lemma 2), we have…”

Section: A Proof Of Converse Of Theoremmentioning

confidence: 99%

“…This work explores such a setting. We also derive capacity results for the secret key agreement problem when the sender can control the "state" of the channel in the same spirit as the works on probing capacity and channels with action-dependent states [6][7][8].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The sender-excited secret key agreement model: Capacity theorems

Chou

Tan

Draper

2011

2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

We consider the fundamental limits of the secret key generation problem when the sources are excited by the sender. In many practical communication settings, the channel may be influenced by the parties involved. Similar to recent works on probing capacity and channels with action-dependent states, our system model captures such a scenario. We derive single-letter expressions for the secret key capacity. Our coding strategy involves wiretap channel coding and a key generation scheme. By assuming that the eavesdropper receives a degraded version of the legitimate receiver's observation, we also obtain a capacity result that does not involve any auxiliary random variables. Finally, by studying two examples, we show that there is a fundamental tradeoff in between the amount of common randomness (i.e., the secret key rate) and the wiretap secrecy rate.

show abstract

On real time coding with limited lookahead

Asnani

Weissman

2011

2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

A real time coding system with lookahead consists of a memoryless source, a memoryless channel, an encoder, which encodes the source symbols sequentially with knowledge of future source symbols upto a fixed finite lookahead, d, with or without feedback of the past channel output symbols and a decoder, which sequentially constructs the source symbols using the channel output. The objective is to minimize the expected per-symbol distortion.For a fixed finite lookahead d ≥ 1 we invoke the theory of controlled markov chains to obtain an average cost optimality equation (ACOE), the solution of which, denoted by D(d), is the minimum expected per-symbol distortion. With increasing d, D(d) bridges the gap between causal encoding, d = 0, where symbol by symbol encoding-decoding is optimal and the infinite lookahead case, d = ∞, where Shannon Theoretic arguments show that separation is optimal.We extend the analysis to a system with finite state decoders, with or without noise-free feedback. For a Bernoulli source and binary symmetric channel, under hamming loss, we compute the optimal distortion for various source and channel parameters, and thus obtain computable bounds on D(d). We also identify regions of source and channel parameters where symbol by symbol encoding-decoding is suboptimal. Finally, we demonstrate the wide applicability of our approach by applying it in additional coding scenarios, such as the case where the sequential decoder can take cost constrained actions affecting the quality or availability of side information about the source.

show abstract

Source and channel coding with action-dependent partially known two-sided state information

Cited by 16 publications

References 7 publications

Source coding with common reconstruction and action-dependent side information

Source coding with common reconstruction and action-dependent side information

The sender-excited secret key agreement model: Capacity theorems

On real time coding with limited lookahead

Contact Info

Product

Resources

About