We prove lower bounds on the redundancy necessary to represent a set $S$ of objects using a number of bits close to the information-theoretic minimum $\log_2 |S|$, while answering various queries by probing few bits. Our main results are: \begin{itemize} \item To represent $n$ ternary values $t \in \zot^n$ in ... more >>>