DocumentCode :
2989624
Title :
On secrecy capacity per unit cost
Author :
El-Halabi, Mustafa ; Liu, Tie ; Georghiades, Costas
Author_Institution :
Dept. of Electr. & Comput. Eng., Texas A&M Univ., College Station, TX, USA
fYear :
2009
fDate :
June 28 2009-July 3 2009
Firstpage :
2301
Lastpage :
2305
Abstract :
The concept of channel capacity per unit cost was introduced by Verdu in 1990 to study the limits of wideband communication. It was shown that an orthogonal coding scheme achieves the channel capacity per unit cost of memoryless stationary channels with a zero-cost input letter. This paper introduces the concept of secrecy capacity per unit cost to study wideband secrecy communications. For degraded memoryless stationary wiretap channels, it is shown that an orthogonal coding scheme achieves the secrecy capacity per unit cost with a zero-cost input letter. For general memoryless stationary wiretap channels, the performance of orthogonal codes is studied and lower and upper bounds on the secrecy capacity per unit cost are provided.
Keywords :
broadband networks; costing; orthogonal codes; channel capacity; memoryless stationary channels; orthogonal coding scheme; secrecy capacity per unit cost; wideband communication; zero-cost input letter; Bandwidth; Batteries; Capacity planning; Channel capacity; Context; Costs; Degradation; Satellites; Upper bound; Wideband;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
Type :
conf
DOI :
10.1109/ISIT.2009.5205922
Filename :
5205922
Link To Document :
بازگشت