On secrecy capacity per unit cost

Authors:
Mustafa EI-Halabi;Tie Liu;Costas Georghiades
Affiliations:
Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX;Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX;Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 3
Cited 0

Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
A note on the secrecy capacity of the multiple-antenna wiretap channel

IEEE Transactions on Information Theory
Opportunistic orthogonal writing on dirty paper

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of channel capacity per unit cost was introduced by Verdú 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.