A Probabilistic Version of Sperner's Theorem, With Applications to the Problem of Retrieving Information From a Data Base

L. D. Baumert; R. J. McEliece; E. R. Rodemich; H. Rumsey, Jr.

Interplanetary Network Progress Report ▸ Volume 42-46 ▸ August 15, 1978

A Probabilistic Version of Sperner's Theorem, With Applications to the Problem of Retrieving Information From a Data Base

L. D. Baumert, R. J. McEliece, E. R. Rodemich, and H. Rumsey, Jr.

pp. 81–86 • 498.5 KB

📄 Download PDF ← View in Issue

Citation

Abstract

We show how the design of an optimal “merged kevcode”’ information retrieval system involves finding the probability distribution on n-bit binary words that minimizes ., Y,,are selected independently according to the given probability distribution. We then find the minimizing probability distribution in the caser= 1,

Details

Volume: 42-46
Published: August 15, 1978
Pages: 81–86
File Size: 498.5 KB