Abstract
Recently, there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. In this paper, we take a deterministic view and revisit the problem of wiretap channel with side information. A precise characterization of the secrecy capacity is obtained for a linear deterministic model, which naturally suggests a coding scheme which we show to achieve the secrecy capacity of the degraded Gaussian model (dubbed as secret writing on dirty paper) to within half a bit.
| Original language | English |
|---|---|
| Article number | 6168835 |
| Pages (from-to) | 3419-3429 |
| Number of pages | 11 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 58 |
| Issue number | 6 |
| DOIs | |
| State | Published - 2012 |
Keywords
- Dirty-paper coding
- information-theoretic security
- linear deterministic model
- side information
- wiretap channel
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences