2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) 2018
DOI: 10.1109/allerton.2018.8636094
|View full text |Cite
|
Sign up to set email alerts
|

Finite-State Channel with Feedback and Causal State Information Available at the Encoder

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…There are some additional special cases of FSCs where the feedback capacity is known explicitly. One method to compute an explicit feedback capacity expression is by formulating it as a dynamic programming (DP) optimization problem, as was first introduced in Tatikonda's thesis [36] and then in [25], [27], [37]- [40]. This is beneficial in estimating the feedback capacity using efficient algorithms such as the value iteration algorithm [41], which, in turn, can help in generating a conjecture for the exact solution of the corresponding Bellman equation [42].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…There are some additional special cases of FSCs where the feedback capacity is known explicitly. One method to compute an explicit feedback capacity expression is by formulating it as a dynamic programming (DP) optimization problem, as was first introduced in Tatikonda's thesis [36] and then in [25], [27], [37]- [40]. This is beneficial in estimating the feedback capacity using efficient algorithms such as the value iteration algorithm [41], which, in turn, can help in generating a conjecture for the exact solution of the corresponding Bellman equation [42].…”
Section: Introductionmentioning
confidence: 99%
“…This side information may generally be beneficial for increasing the feedback capacity of channels with memory. The capacity problem of discrete memoryless channels (DMCs) with states known at the encoder dates back to Shannon's early work [55], followed by works of Kusnetsov and Tsybakov [56], Gel'fand and Pinsker [57], and Heegard and El Gamal [58], which paved the way to various recent works such as [40], [59]- [67]. Since Shannon showed in [17] that feedback does not increase the capacity of a DMC, his setting in [55], where the state process is i.i.d.…”
Section: Introductionmentioning
confidence: 99%
“…There are some additional special cases of FSCs where the feedback capacity is known explicitly. One method to compute explicit feedback capacity expression is by formulating it as a dynamic programming (DP) optimization problem, as was first introduced in Tatikonda's thesis [38] and then in [25], [27], [30], [39]- [41]. This is beneficial in estimating the feedback capacity using efficient algorithms such as the value iteration algorithm [42], which, in turn, can help in generating a conjecture for the exact solution of the corresponding Bellman equation [43].…”
Section: Introductionmentioning
confidence: 99%
“…Gel'fand and Pinsker [58], and Heegard and El Gamal [59], which paved the way to various recent works such as [30], [31], [60]- [63]. Since Shannon showed in [17] that feedback does not increase the capacity of a DMC, his setting in [56], where the state process was distributed i.i.d.…”
Section: Introductionmentioning
confidence: 99%