Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs.
IEEE Transactions on Information Theory(2018)
摘要
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, w...
更多查看译文
关键词
Upper bound,Computer science,Electronic mail,Adders,Information technology,Hypercubes,Entropy
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络