Hide and Seek, Data Storage, and Entropy
From MaRDI portal
Publication:5643990
DOI10.1214/aoms/1177693169zbMath0235.05001OpenAlexW2033050904MaRDI QIDQ5643990
Edward C. Posner, Robert J. McEliece
Publication date: 1971
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177693169
Related Items
On Extremal Set Partitions in Cartesian Product Spaces, Shannon capacity and the categorical product, An Analogue of the Shannon Capacity of a Graph, A Caching Game with Infinitely Divisible Hidden Material, A survey on hypergraph products, Asymptotic values of the Hall-ratio for graph powers, New bounds for perfect \(k\)-hashing, A new property of the Lovász number and duality relations between graph parameters, On the ratio of optimal integral and fractional covers, Matchings and covers in hypergraphs, Numerical invariants and the strong product of graphs, Covering tori with squares, On the ultimate lexicographic Hall-ratio, Local chromatic number and Sperner capacity