Sharper upper bounds for unbalanced uniquely decodable code pairs

Thumbnail Image

Files

Austrin_etal_Sharper_upper_bounds_IEEETranInfTheory_2018.pdf (627.49 KB)

Access rights

openAccess
acceptedVersion

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.

Authors

Date

2018-02-01

Department

Department of Computer Science

Major/Subject

Mcode

Degree programme

Language

en

Pages

6

Series

IEEE Transactions on Information Theory, Volume 64, issue 2, pp. 1368-1373

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.

Description

| openaire: EC/FP7/338077/EU//TAPEASE

Keywords

Additive combinatorics, Binary adder channel, Isoperimetric inequality, Uniquely decodeable code pair, Zero-error capacity

Other note

DOI

10.1109/TIT.2017.2688378

Citation

Austrin, 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.2688378

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-202510087726

Collections

[article-cris] Perustieteiden korkeakoulu / SCI