Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs

DOI10.1109/TIT.2017.2688378zbMath1390.94920arXiv1605.00462OpenAlexW2597941492MaRDI QIDQ4566709

Per Austrin, Jesper Nederlof, Petteri Kaski, Mikko Koivisto

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00462

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (2)

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics ⋮ Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems

This page was built for publication: Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs