Information Theoretic Security and Privacy of Information Systems by Rafael F. Schaefer Holger Boche Ashish Khisti and H. Vincent Poor

Author:Rafael F. Schaefer, Holger Boche, Ashish Khisti and H. Vincent Poor
Language: eng
Format: azw3
Publisher: Cambridge University Press
Published: 2017-06-30T04:00:00+00:00

10.3.2 The Non-Assisted Capacity

The Impact of Symmetrizability

For those cases where the secret or partially secret common randomness Γ is set to one for every number of channel uses, we have to deal with the symmetrizability properties of the legal link 𝔚 from Alice to Bob. Initial statements in that case are as follows:

THEOREM 10.4 (Symmetrizability properties of CS)

1. If 𝔚 is symmetrizable, then CS(𝔚,𝔙) = 0.

2. If 𝔚 is non-symmetrizable, then CS(𝔚,𝔙) = CS, ranmean(𝔚,𝔙).

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.