Arikan, E.2015-07-282015-07-281994-070018-9448http://hdl.handle.net/11693/13611We present an upper bound on the zero-error list-coding capacity of discrete memoryless channels. Using this bound, we show that the list3 capacity of the 4/3 channel is at most 03512 b, improving the best previous bound. The relatien of the bound to earlier similar bouads, in particular, to Korner's graph+ntropy bound, is discussed.EnglishZero-error CapacityList-codingPerfect-hashingGraph-entrokShannon capacity of graphsArticle10.1109/18.3359471557-9654