[go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1311.3918 (cs)
[Submitted on 15 Nov 2013 (v1), last revised 16 Jan 2014 (this version, v2)]

Title:Sum Secrecy Rate in Full-Duplex Wiretap Channel with Imperfect CSI

Authors:Sanjay Vishwakarma, A. Chockalingam
View PDF
Abstract:In this paper, we consider the achievable sum secrecy rate in full-duplex wiretap channel in the presence of an eavesdropper and imperfect channel state information (CSI). We assume that the users participating in full-duplex communication and the eavesdropper have single antenna each. The users have individual transmit power constraints. They also transmit jamming signals to improve the secrecy rates. We obtain the achievable perfect secrecy rate region by maximizing the sum secrecy rate. We also obtain the corresponding optimum powers of the message signals and the jamming signals. Numerical results that show the impact of imperfect CSI on the achievable secrecy rate region are presented.
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1311.3918 [cs.IT]
  (or arXiv:1311.3918v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1311.3918

Submission history

From: Sanjay Vishwakarma [view email]
[v1] Fri, 15 Nov 2013 16:40:55 UTC (97 KB)
[v2] Thu, 16 Jan 2014 14:24:36 UTC (35 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2013-11
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Sanjay Vishwakarma
A. Chockalingam
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)