Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs

Show full item record



Permalink

http://hdl.handle.net/10138/288206

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 , pp. 1368-1373 . https://doi.org/10.1109/TIT.2017.2688378

Title: Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
Author: Austrin, Per; Kaski, Petteri; Koivisto, Mikko; Nederlof, Jesper
Contributor: University of Helsinki, Helsinki Institute for Information Technology HIIT
University of Helsinki, Department of Computer Science
Date: 2018-02
Language: eng
Number of pages: 6
Belongs to series: IEEE Transactions on Information Theory
ISSN: 0018-9448
URI: http://hdl.handle.net/10138/288206
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.
Subject: Additive combinatorics
binary adder channel
isoperimetric inequality
uniquely decodeable code pair
zero-error capacity
BINARY ADDER CHANNEL
CONSTRUCTION
113 Computer and information sciences
Rights:


Files in this item

Total number of downloads: Loading...

Files Size Format View
TIT2688378.pdf 346.6Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record