Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs

Simple item page
dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.authorAustrin, Per
dc.contributor.authorKaski, Petteri
dc.contributor.authorKoivisto, Mikko
dc.contributor.authorNederlof, Jesper
dc.contributor.departmentTietotekniikan laitosfi
dc.contributor.departmentDepartment of Computer Scienceen
dc.contributor.schoolPerustieteiden korkeakoulufi
dc.contributor.schoolSchool of Scienceen
dc.date.accessioned2018-09-26T09:03:15Z
dc.date.available2018-09-26T09:03:15Z
dc.date.issued2018
dc.description| openaire: EC/FP7/338077/EU//TAPEASE
dc.description.abstractTwo 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.description.versionPeer revieweden
dc.format.extent1368-1373
dc.format.mimetypeapplication/pdfen
dc.identifier.citationAustrin, 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.doi10.1109/tit.2017.2688378
dc.identifier.issn0018-9448 (printed)
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/34079
dc.identifier.urnURN:NBN:fi:aalto-201809255163
dc.language.isoenen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.ispartofseriesVolume 64, Issue 2
dc.relation.ispartofseriesIEEE Transactions on Information Theoryen
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.rights.holderInstitute of Electrical and Electronics Engineers (IEEE)
dc.subject.keywordadditive combinatoricsen
dc.subject.keywordbinary adder channelen
dc.subject.keywordisoperimetric inequalityen
dc.subject.keyworduniquely decodeable code pairen
dc.subject.keywordzero-error capacityen
dc.subject.otherComputer scienceen
dc.subject.otherMathematicsen
dc.titleSharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairsen
dc.typeA1 Alkuperäisartikkeli tieteellisessä aikakauslehdessäfi
dc.type.dcmitypetexten
dc.type.versionPost printen

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
A1_austrin_per_2018.pdf
Size:
565.67 KB
Format:
Adobe Portable Document Format
Description:
Download

Collections

[article] Perustieteiden korkeakoulu / SCI