Show simple item record

dc.contributor.authorPolyanskiy, Yury
dc.date.accessioned2016-01-27T16:29:03Z
dc.date.available2016-01-27T16:29:03Z
dc.date.issued2015-06
dc.identifier.isbn978-1-4673-7704-1
dc.identifier.urihttp://hdl.handle.net/1721.1/100999
dc.description.abstractConsider 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.sponsorshipNational Science Foundation (U.S.) (Grant CCF-13-18620)en_US
dc.description.sponsorshipNational Science Foundation (U.S.). Science and Technology Center (Grant CCF-09-39370)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ISIT.2015.7282852en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleUpper bound on list-decoding radius of binary codesen_US
dc.typeArticleen_US
dc.identifier.citationPolyanskiy, Yury. “Upper Bound on List-Decoding Radius of Binary Codes.” 2015 IEEE International Symposium on Information Theory (ISIT) (June 2015).en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorPolyanskiy, Yuryen_US
dc.relation.journalProceedings of the 2015 IEEE International Symposium on Information Theory (ISIT)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsPolyanskiy, Yuryen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-2109-0979
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record