| Popis: |
Two main ingredients that enable wiretap codes to achieve information-theoretic secrecy are their binning structure and the randomization among multiple codewords. The presence of an infinite amount of randomness is an oversimplifying assumption which act as a hurdle that prevents the development of practical codes for wiretap channels. In this paper, we investigate the trade-off between the achievable secrecy rate and the randomness rate for wiretap channels with side information, non-causally known to the transmitter. Using the linear deterministic approach, we present insights into finding near-optimal codes under limited randomness. |
