On the Computability of Finding Capacity-Achieving Codes

Angelos Gkekas, Nikos A. Mitsiou, Ioannis Souldatos +1

This work studies the problem of constructing capacity-achieving codes from an algorithmic perspective. Specifically, we prove that there exists a Turing machine which, given a dis…