Theorem: Lower bound on total queries for arbitrarily small error

• If requested bits are all independent, minimum queries when maximum rate:

• Minimum no. of queries on average

• = target entropy/maximum rate

• = target entropy/channel capacity;

• n  k/C - 

• Shown using the source-channel coding theorem which enables entropy to be addressed separately from the query pattern

Notes: