Codebook Generation. Assume that the input distribu- tion is such that I(u; yr) > I(u; s) as required in Theorem 1. Let εn be a sequence of non-negative numbers that goes to zero such that 2εn < I(u; yr) − I(u; s). • Generate a total of T = 2n(I(u;yr)−2εn ) sequences. Each sequence is sampled i.i.d. from a distribution p (·). Label available power is used for transmitting the secret-message. As the signal-to-noise ratio increases more information regarding − − 1 T them un, . . . , un . sr gets leaked to the eavesdropper and to compensate for this effect, a non-zero fraction of power is transmitted when sr = 0.
Appears in 2 contracts
Sources: Secret Key Agreement, Secret Key Agreement