Wiretap Channel with Rate-Limited Channel State Information

Xinxing Yin, Liang Pang and Zhi Xue

Mathematical Problems in Engineering, 2015, vol. 2015, 1-10

Abstract:

We revisit a channel coding problem where the channel state information (CSI) is rate-limited (or coded) and available to the channel encoder. A wiretapper is added into this model, and the confidential message is intended only for the legal receiver and should be kept from being eavesdropped by the wiretapper. Equivocation analysis is provided to evaluate the level of information leakage to the wiretapper. We characterize an achievable rate-equivocation region as well as an outer bound for this security model. To achieve the rate-equivocation triples, we propose an efficient coding scheme, in which the coded CSI serves as the CSI for the channel encoder, based on Gel’fand and Pinsker’s coding and Wyner’s random coding . Furthermore, an example of Gaussian wiretap channel with rate-limited CSI is presented, of which a lower bound on the secrecy capacity is obtained. By simulation, we find there exists an optimal rate of the coded CSI at which the biggest secrecy transmission rate of the Gaussian case is achieved.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/643265.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/643265.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:643265

DOI: 10.1155/2015/643265

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().