Coding for noisy feasible channels

Abstract

Summary form only given. The author proves a constructive version of Shannon's fundamental theorem of information theory. The new theorem holds for any feasible channel. A channel is feasible provided it is computable by a polynomial time computation.