Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Secrecy rates of finite-input intersymbol interference channels

Serdar Hanoğlu

Published Oct 1, 2016• 1 citation
OpenAlex

Abstract

Cataloged from PDF version of article.

Related papers

Ergodic secrecy rate of two-user MISO interference channels with statistical CSI

Zesong Fei, Jiqing Ni, Di Zhao +3 more

Science China Information Sciences•Sep 5, 2014•13 citations

Artificial-Noise-Aided Secure Transmission over Finite-Input Intersymbol Interference Channels

Serdar Hanoğlu, Sina Rezaei Aghdam, Tolga M. Duman

We propose an artificial noise (AN) injection strategy for securing communication over finite-input intersymbol interference (lSI) channels. The technique relies on injection of colored noise whose power spectral density has the least match with the spectrum of the main channel in a certain sense. By evaluation of an achievable secrecy rate, we demonstrate that the proposed AN injection based solution results in a considerable improvement over the existing approaches, especially when the eavesdropper works at high signal-to-noise ratios (SNRs).

•Jun 1, 2018•4 citations

Secrecy Capacity of Independent Parallel Channels

Zang Li, Roy D. Yates, Wade K. Trappe

Springer eBooks•Jan 1, 2009•173 citations

Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels

Aria Nouri, Reza Asvadi, Jun Chen +1 more

We consider reliable and secure communication over intersymbol interference wiretap channels (ISI-WTCs). In particular, we first derive an achievable secure rate for ISI-WTCs without imposing any constraints on the input distribution. Afterwards, we focus on the setup where the input distribution of the ISI-WTC is constrained to be a time-invariant finite-order Markov chain. Optimizing the parameters of this Markov chain toward maximizing the achievable secure rates is a computationally intractable problem in general, and so, toward finding a local maximum, we propose an iterative algorithm that at every iteration replaces the secure rate function with a suitable surrogate function whose maximum can be found efficiently. Although the secure rates achieved in the unconstrained setup are potentially larger than the secure rates achieved in the constrained setup, the latter setup has the advantage of leading to efficient algorithms for estimating and optimizing the achievable secure rates, and also has the benefit of being the basis of efficient coding schemes.

arXiv:2102.04941•IEEE Transactions on Communications•Mar 13, 2023•2 citations

Secrecy Precoder Design for k-User MIMO Interference Channels

Bing Fang, Wei Shao

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2020•0 citations

Artificial intersymbol interference (ISI) to exploit receiver imperfections for secrecy

Azadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik

Secure communication over a wireless channel in the presence of a passive eavesdropper is considered. We present a method to exploit the eavesdropper's inherent receiver vulnerabilities to obtain everlasting secrecy. An ephemeral cryptographic key is pre-shared between the transmitter and the legitimate receiver and is utilized to induce intentional intersymbol interference (ISI). The legitimate receiver uses the key to cancel the ISI while the eavesdropper, since it does not have the key, cannot do such. It is shown that although ISI reduces the capacity of the main channel, it can lead to a net gain in secrecy rate. The achievable secrecy rates for different ISI filter settings are evaluated and the proposed method is compared with other information-theoretic security schemes.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2013•12 citations
We propose an artificial noise (AN) injection strategy for securing communication over finite-input intersymbol interference (lSI) channels. The technique relies on injection of colored noise whose power spectral density has the least match with the spectrum of the main channel in a certain sense. By evaluation of an achievable secrecy rate, we demonstrate that the proposed AN injection based solution results in a considerable improvement over the existing approaches, especially when the eavesdropper works at high signal-to-noise ratios (SNRs).
We consider reliable and secure communication over intersymbol interference wiretap channels (ISI-WTCs). In particular, we first derive an achievable secure rate for ISI-WTCs without imposing any constraints on the input distribution. Afterwards, we focus on the setup where the input distribution of the ISI-WTC is constrained to be a time-invariant finite-order Markov chain. Optimizing the parameters of this Markov chain toward maximizing the achievable secure rates is a computationally intractable problem in general, and so, toward finding a local maximum, we propose an iterative algorithm that at every iteration replaces the secure rate function with a suitable surrogate function whose maximum can be found efficiently. Although the secure rates achieved in the unconstrained setup are potentially larger than the secure rates achieved in the constrained setup, the latter setup has the advantage of leading to efficient algorithms for estimating and optimizing the achievable secure rates, and also has the benefit of being the basis of efficient coding schemes.
Secure communication over a wireless channel in the presence of a passive eavesdropper is considered. We present a method to exploit the eavesdropper's inherent receiver vulnerabilities to obtain everlasting secrecy. An ephemeral cryptographic key is pre-shared between the transmitter and the legitimate receiver and is utilized to induce intentional intersymbol interference (ISI). The legitimate receiver uses the key to cancel the ISI while the eavesdropper, since it does not have the key, cannot do such. It is shown that although ISI reduces the capacity of the main channel, it can lead to a net gain in secrecy rate. The achievable secrecy rates for different ISI filter settings are evaluated and the proposed method is compared with other information-theoretic security schemes.