Title :
Coding for noisy feasible channels
Author :
Lipton, Richard J.
Author_Institution :
Dept. of Comput. Sci., Princeton Univ., NJ, USA
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
Keywords :
channel coding; encoding; information theory; noise; telecommunication channels; Shannon´s fundamental theorem; coding; information theory; noisy feasible channels; polynomial time computation; Capacity planning; Channel capacity; Computer science; Decoding; Digital systems; Information theory; Performance evaluation; Polynomials;
Conference_Titel :
Information Theory and Statistics, 1994. Proceedings., 1994 IEEE-IMS Workshop on
Conference_Location :
Alexandria, VA
Print_ISBN :
0-7803-2761-6
DOI :
10.1109/WITS.1994.513865
