Arıkan, Erdal2016-02-082016-02-081990http://hdl.handle.net/11693/27824Date of Conference: 14-19 January 1990Conference Name: IEEE International Symposium on Information Theory, ISIT 1990Summary form only given. A number of questions recently raised by Elias regarding a zero-error list-of-L code have been addressed. It has been shown that computing the zero-error capacity of the channel with feedback is NP-complete, and bounds on the size of the code have been obtained.EnglishCodes, symbolicComputer metatheoryFeedback channelsList decodingNP completenessZero error capacityInformation theoryComputational complexityConference Paper