| dc.contributor.author | Dalai, Marco | |
| dc.contributor.author | Polyanskiy, Yury | |
| dc.date.accessioned | 2018-02-05T16:36:02Z | |
| dc.date.available | 2018-02-05T16:36:02Z | |
| dc.date.issued | 2016-07 | |
| dc.date.submitted | 2016-08 | |
| dc.identifier.isbn | 978-1-5090-1806-2 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/113420 | |
| dc.description.abstract | We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability 1/2. The lower bound is more of theoretical than practical importance; it improves very marginally the expurgated bound, providing a counterexample to a conjecture on its tightness by Shannon, Gallager and Berlekamp which does not need the construction of algebraic-geometric codes previously used by Katsman, Tsfasman and Vlăduţ. The upper bound is derived by using an adaptation of the linear programming bound and it is essentially useful as a low-rate anchor for the straight line bound. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant CCF-13-18620) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.). Center for Science of Information (Grant Agreement CCF-09- 39370) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1109/ISIT.2016.7541592 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | Bounds on the reliability of a typewriter channel | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Dalai, Marco, and Yury Polyanskiy. “Bounds on the Reliability of a Typewriter Channel.” 2016 IEEE International Symposium on Information Theory (ISIT),
10-15 July, 2016, Barcelona, Spain, IEEE, 2016. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.mitauthor | Polyanskiy, Yury | |
| dc.relation.journal | 2016 IEEE International Symposium on Information Theory (ISIT) | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Dalai, Marco; Polyanskiy, Yury | en_US |
| dspace.embargo.terms | N | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0002-2109-0979 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
