Wolf. [64]) Let S = (S1, S2, . . . , Sn) be a sequence of n binary, random variables. For any k-tuple i = (i1, i2, . . . , ik), where 1 ≤ i1 < i2 < · · · < ik ≤ n, let Si be the substring (Si1 , Si2 , . . . , Sik ). Then Hα(Si) ≥ Hα(S) — (n — k) for α = 2 and α = ∞.
Appears in 2 contracts
Sources: Information Theoretic Secret Key Agreement, Information Theoretic Secret Key Agreement