Title :
Secret writing on dirty paper: A deterministic view
Author :
El-Halabi, Mustafa ; Liu, Tie ; Georghiades, Costas ; Shamai, Shlomo
Author_Institution :
Dept. of Electr. & Comput. Eng., Texas A&M Univ., College Station, TX, USA
fDate :
July 31 2011-Aug. 5 2011
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 (1/2) log 3 bits.
Keywords :
Gaussian channels; approximation theory; channel capacity; channel coding; Gaussian network capacity; approximate characterization; coding scheme; degraded Gaussian model; dirty paper; linear deterministic model; secret writing; side information; wiretap channel; Channel capacity; Encoding; Interference; Random variables; Receivers; Vectors; Writing;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6034009
