Turing Meets Shannon: On the Algorithmic Construction of Channel-Aware Codes
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Communications"
DOI: 10.1109/tcomm.2022.3146298
Abstract: A capacity result involves two parts: achievability and converse. The achievability proof is usually non-constructive and only the existence of capacity-achieving codes is shown invoking probabilistic techniques. Recently, capacity-achieving codes have been found for several… read more here.
Keywords: channel aware; capacity achieving; construction; capacity ... See more keywords