dc.contributor.author | Polyanskiy, Yury | |
dc.date.accessioned | 2016-01-27T16:29:03Z | |
dc.date.available | 2016-01-27T16:29:03Z | |
dc.date.issued | 2015-06 | |
dc.identifier.isbn | 978-1-4673-7704-1 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/100999 | |
dc.description.abstract | Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with multiplicity at most L. For odd L ≥ 3 an asymptotic upper bound on the rate of any such packing is proven. The resulting bound improves the best known bound (due to Blinovsky' 1986) for rates below a certain threshold. The method is a superposition of the linear- programming idea of Ashikhmin, Barg and Litsyn (that was used previously to improve the estimates of Blinovsky for L = 2) and a Ramsey-theoretic technique of Blinovsky. As an application it is shown that for all odd L the slope of the rate-radius tradeoff is zero at zero rate. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (Grant CCF-13-18620) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.). Science and Technology Center (Grant 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.2015.7282852 | 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 | MIT web domain | en_US |
dc.title | Upper bound on list-decoding radius of binary codes | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Polyanskiy, Yury. “Upper Bound on List-Decoding Radius of Binary Codes.” 2015 IEEE International Symposium on Information Theory (ISIT) (June 2015). | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.mitauthor | Polyanskiy, Yury | en_US |
dc.relation.journal | Proceedings of the 2015 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 | Polyanskiy, Yury | en_US |
dc.identifier.orcid | https://orcid.org/0000-0002-2109-0979 | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |