Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs

Loading...
Thumbnail Image
Journal Title
Journal ISSN
Volume Title
School of Science | A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
Date
2018
Major/Subject
Mcode
Degree programme
Language
en
Pages
1368-1373
Series
Volume 64, Issue 2, IEEE Transactions on Information Theory
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
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.