Arikan, E.2016-02-082016-02-081988189448http://hdl.handle.net/11693/26273An upper bound is given on the cutoff rate of discrete memoryless channels. This upper bound, which coincides with a known lower bound, determines the cutoff rate, and settles a long-standing open problem. © 1988 IEEEEnglishDIGITAL COMMUNICATION SYSTEMSINFORMATION THEORY - Communication ChannelsPROBABILITYDISCRETE MEMORYLESS CHANNELSSEQUENTIAL DECODINGCODES, SYMBOLICArticle10.1109/18.2601