Turing Meets Shannon: Algorithmic Constructability of Capacity-Achieving Codes

Boche, Holger; Schaefer, Rafael F.; Poor, H. Vincent

doi:10.1109/icc42927.2021.9500750

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2024

Publication Types

Select...

Article2

Other1

Relationship

Self Cite1

Independent2

Authors

Journals

Cited by 3 publications

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

On the Effectiveness of Fekete’s Lemma in Information Theory

Boche

Böck

Deppe

2021

2020 IEEE Information Theory Workshop (ITW)

Self Cite

View full text Add to dashboard Cite

Fekete's lemma is a well known combinatorial result pertaining to number sequences and shows the existence of limits of superadditive sequences. In this paper we analyze Fekete's lemma with respect to effective convergence and computability. We show that Fekete's lemma exhibits no constructive derivation.That is, a form of the axiom of choice is needed for the proof. We characterize when the limit value in Fekete's lemma can be computed and when it is not possible. We also investigate the speed of convergence. Given certain conditions, we can show effective convergence. In general, there is no effective convergence when applying Fekete's lemma.

show abstract