Show simple item record

dc.contributor.authorArikan, E.en_US
dc.date.accessioned2016-02-08T10:57:26Z
dc.date.available2016-02-08T10:57:26Z
dc.date.issued1988en_US
dc.identifier.issn189448
dc.identifier.urihttp://hdl.handle.net/11693/26273
dc.description.abstractAn 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 IEEEen_US
dc.language.isoEnglishen_US
dc.source.titleIEEE Transactions on Information Theoryen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/18.2601en_US
dc.subjectDIGITAL COMMUNICATION SYSTEMSen_US
dc.subjectINFORMATION THEORY - Communication Channelsen_US
dc.subjectPROBABILITYen_US
dc.subjectDISCRETE MEMORYLESS CHANNELSen_US
dc.subjectSEQUENTIAL DECODINGen_US
dc.subjectCODES, SYMBOLICen_US
dc.titleAn Upper Bound on the Cutoff Rate of Sequential Decodingen_US
dc.typeArticleen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.citation.spage55en_US
dc.citation.epage63en_US
dc.citation.volumeNumber34en_US
dc.citation.issueNumber1en_US
dc.identifier.doi10.1109/18.2601en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record