Sharper upper bounds for unbalanced uniquely decodable code pairs

Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

3 Citaten (Scopus)


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.

Originele taal-2Engels
Pagina's (van-tot)1368-1373
Aantal pagina's6
TijdschriftIEEE Transactions on Information Theory
Nummer van het tijdschrift2
StatusGepubliceerd - 1 feb 2018

Bibliografische nota

to appear

Citeer dit