An Upper Bound on the Cutoff Rate of Sequential Decoding
dc.citation.epage | 63 | en_US |
dc.citation.issueNumber | 1 | en_US |
dc.citation.spage | 55 | en_US |
dc.citation.volumeNumber | 34 | en_US |
dc.contributor.author | Arikan, E. | en_US |
dc.date.accessioned | 2016-02-08T10:57:26Z | |
dc.date.available | 2016-02-08T10:57:26Z | |
dc.date.issued | 1988 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description.abstract | An 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 IEEE | en_US |
dc.identifier.doi | 10.1109/18.2601 | en_US |
dc.identifier.issn | 189448 | |
dc.identifier.uri | http://hdl.handle.net/11693/26273 | |
dc.language.iso | English | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/18.2601 | en_US |
dc.source.title | IEEE Transactions on Information Theory | en_US |
dc.subject | DIGITAL COMMUNICATION SYSTEMS | en_US |
dc.subject | INFORMATION THEORY - Communication Channels | en_US |
dc.subject | PROBABILITY | en_US |
dc.subject | DISCRETE MEMORYLESS CHANNELS | en_US |
dc.subject | SEQUENTIAL DECODING | en_US |
dc.subject | CODES, SYMBOLIC | en_US |
dc.title | An Upper Bound on the Cutoff Rate of Sequential Decoding | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- An Upper Bound on the Cutoff Rate of Sequential Decoding.pdf
- Size:
- 771.2 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full Printable Version