Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.author Austrin, Per
dc.contributor.author Kaski, Petteri
dc.contributor.author Koivisto, Mikko
dc.contributor.author Nederlof, Jesper
dc.date.accessioned 2018-09-26T09:03:15Z
dc.date.available 2018-09-26T09:03:15Z
dc.date.issued 2018
dc.identifier.citation Austrin, Per & Kaski, Petteri & Koivisto, Mikko & Nederlof, Jesper. 2018. Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. IEEE Transactions on Information Theory, Volume 64, Issue 2. 1368-1373. ISSN 0018-9448 (printed). DOI: 10.1109/tit.2017.2688378. en
dc.identifier.issn 0018-9448 (printed)
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/34079
dc.description | openaire: EC/FP7/338077/EU//TAPEASE
dc.description.abstract Two sets of 0-1 vectors of fixed length form a uniquely decodeable code pair if their Cartesian product is of the same size as their sumset, where the addition is pointwise over integers. For the size of the sumset of such a pair, van Tilborg has given an upper bound in the general case. Urbanke and Li, and later Ordentlich and Shayevitz, have given better bounds in the unbalanced case, that is, when either of the two sets is sufficiently large. Improvements to the latter bounds are presented. en
dc.format.extent 1368-1373
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Institute of Electrical and Electronics Engineers (IEEE) en
dc.relation.ispartofseries Volume 64, Issue 2
dc.relation.ispartofseries IEEE Transactions on Information Theory en
dc.rights © 2018 Institute of Electrical and Electronics Engineers (IEEE) Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting /republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. en
dc.subject.other Computer science en
dc.subject.other Mathematics en
dc.title Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs en
dc.type A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä fi
dc.description.version Peer reviewed en
dc.rights.holder Institute of Electrical and Electronics Engineers (IEEE)
dc.contributor.school Perustieteiden korkeakoulu fi
dc.contributor.school School of Science en
dc.contributor.department Tietotekniikan laitos fi
dc.contributor.department Department of Computer Science en
dc.subject.keyword additive combinatorics en
dc.subject.keyword binary adder channel en
dc.subject.keyword isoperimetric inequality en
dc.subject.keyword uniquely decodeable code pair en
dc.subject.keyword zero-error capacity en
dc.identifier.urn URN:NBN:fi:aalto-201809255163
dc.type.dcmitype text en
dc.identifier.doi 10.1109/tit.2017.2688378
dc.type.version Post print en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search archive


Advanced Search

article-iconSubmit a publication

Browse

My Account