An upper bound for codes in a two-access binary erasure channel (Corresp.)

DOI10.1109/TIT.1978.1055814zbMath0371.94036MaRDI QIDQ4149660

Henk C. A. van Tilborg

Publication date: 1978

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

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (3)

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 ⋮ An Upper Bound on the Sizes of Multiset-Union-Free Families

This page was built for publication: An upper bound for codes in a two-access binary erasure channel (Corresp.)