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.departmentDepartment of Computer Scienceen
dc.contributor.groupauthorHelsinki Institute for Information Technology (HIIT)en
dc.contributor.groupauthorProfessorship Kaski Petterien
dc.contributor.organizationAalto University
dc.contributor.organizationEindhoven University of Technology
dc.contributor.organizationKTH Royal Institute of Technology
dc.date.accessioned2025-10-08T06:45:26Z
dc.date.available2025-10-08T06:45:26Z
dc.date.issued2018-02-01
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.extent6
dc.format.mimetypeapplication/pdf
dc.identifier.citationAustrin, P, Kaski, P, Koivisto, M & Nederlof, J 2018, 'Sharper upper bounds for unbalanced uniquely decodable code pairs', IEEE Transactions on Information Theory, vol. 64, no. 2, 7888502, pp. 1368-1373. https://doi.org/10.1109/TIT.2017.2688378en
dc.identifier.doi10.1109/TIT.2017.2688378
dc.identifier.issn0018-9448
dc.identifier.issn1557-9654
dc.identifier.otherPURE UUID: 58b6bdb4-6094-48fb-8f90-3c43c44ecea7
dc.identifier.otherPURE ITEMURL: https://research.aalto.fi/en/publications/58b6bdb4-6094-48fb-8f90-3c43c44ecea7
dc.identifier.otherPURE FILEURL: https://research.aalto.fi/files/28178902/Austrin_etal_Sharper_upper_bounds_IEEETranInfTheory_2018.pdf
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/139545
dc.identifier.urnURN:NBN:fi:aalto-202510087726
dc.language.isoenen
dc.publisherIEEE
dc.relationinfo:eu-repo/grantAgreement/EC/FP7/338077/EU//TAPEASE
dc.relation.fundinginfoManuscript received September 5, 2016; revised February 8, 2017; accepted March 11, 2017. Date of publication March 28, 2017; date of current version January 18, 2018. P. Austrin was supported by the Swedish Research Council, under Grant 621-2012-4546. P. Kaski was supported by the European Research Council, under Grant 338077. M. Koivisto was supported by the Academy of Finland, under Grant 276864. J. Nederlof was supported by the NWO VENI under Project 639.021.438. This paper was presented at the 2016 IEEE International Symposium on Information Theory. (Corresponding Author: Mikko Koivisto.) P. Austrin is with the School of Computer Science and Communication, KTH Royal Institute of Technology, 114 28 Stockholm, Sweden (e-mail: austrin@csc.kth.se).
dc.relation.ispartofseriesIEEE Transactions on Information Theoryen
dc.relation.ispartofseriesVolume 64, issue 2, pp. 1368-1373en
dc.rightsopenAccessen
dc.subject.keywordAdditive combinatorics
dc.subject.keywordBinary adder channel
dc.subject.keywordIsoperimetric inequality
dc.subject.keywordUniquely decodeable code pair
dc.subject.keywordZero-error capacity
dc.titleSharper upper bounds for unbalanced uniquely decodable code pairsen
dc.typeA1 Alkuperäisartikkeli tieteellisessä aikakauslehdessäfi
dc.type.versionacceptedVersion

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Austrin_etal_Sharper_upper_bounds_IEEETranInfTheory_2018.pdf
Size:
627.49 KB
Format:
Adobe Portable Document Format
Download

Collections

[article-cris] Perustieteiden korkeakoulu / SCI