2020
DOI: 10.48550/arxiv.2008.13270
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Shannon Meets Turing: Non-Computability and Non-Approximability of the Finite State Channel Capacity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 30 publications
0
1
0
Order By: Relevance
“…However, this optimization is challenging since analytic computation of DI requires knowledge of the underlying probability law, which is typically unavailable in practice. Furthermore, even when the probability law is given, tractable DI characterizations that lend well for optimization are rare [17,18], as it is generally given by a multiletter expression. To address this, the goal of the paper is to develop a computable and provably accurate estimate of DI.…”
Section: Introductionmentioning
confidence: 99%
“…However, this optimization is challenging since analytic computation of DI requires knowledge of the underlying probability law, which is typically unavailable in practice. Furthermore, even when the probability law is given, tractable DI characterizations that lend well for optimization are rare [17,18], as it is generally given by a multiletter expression. To address this, the goal of the paper is to develop a computable and provably accurate estimate of DI.…”
Section: Introductionmentioning
confidence: 99%