The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Finally, we design ensembles of error-correcting codes that achieve the information-theoretic capacity of a large class of communication channels, and then use the obtained ensembles for construction of ... explicit capacity achieving codes. ... This indeed takes exponential time. Now let L be any language in E which is computable by a Turing machine M in time 2 cn , for some constant c > 0. ...doi:10.5075/epfl-thesis-4767 arXiv:1107.4709v1 fatcat:gq43kigbzzapvp6r5wxgb3i7ym