LDPC-Based Code Hopping for Gaussian Wiretap Channel With Limited Feedback

نویسندگان

  • Zhao Chen
  • Liuguo Yin
  • Jianhua Lu
چکیده

This paper presents a scheme named code hopping (CodeHop) for gaussian wiretap channels based on nonsystematic low-density parity-check (LDPC) codes. Different from traditional communications, in the CodeHop scheme, the legitimate receiver (Bob) rapidly switches the parity-check matrix upon each correctly received source message block. Given an authenticated public feedback channel, the transmitter’s (Alice) paritycheck matrix can also be synchronized with the receiver’s. As a result, once an eavesdropper (Eve) erroneously decodes a message block, she may not be able to follow the update of subsequent parity-check matrices. Thus, the average BER of Eve will be very close to 0.5 if the transmitted number of message blocks is large enough. Focused on the measure of security gap defined as the difference of channel quality between Bob and Eve, numerical results show that the CodeHop scheme outperforms other solutions by sufficiently reducing the security gap without sacrificing the error-correcting performance of Bob.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LDPC-BASED SECRET-SHARING SCHEMES FOR WIRETAP CHANNELS By CHAN WONG WONG A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy LDPC-BASED SECRET-SHARING SCHEMES FOR WIRETAP CHANNELS By Chan Wong Wong December 2011 Chair: John M. Shea Cochair: Tan F. Wong Major: Electrical and Computer Engineering This dissertation examines the practical design of secret-sharing ...

متن کامل

LDPC Codes over Gaussian Multiple Access Wiretap Channel

Abstract: We study the problem of two-user Gaussian multiple access channel (GMAC) in the presence of an external eavesdropper. In this problem, an eavesdropper receives a signal with a lower signal-to-noise ratio (SNR) compared to the legitimate receiver and all transmitted messages should be kept confidential against the eavesdropper. For this purpose, we propose a secure coding scheme on thi...

متن کامل

Low - Density Parity Check Codes for Fading Channelswith

We develop a belief-propagation-based joint decoding and channel state estimation algorithm for low-density parity check codes on fading channels with memory. The excellent empirical performance of LDPC codes on the AWGN channel and the possibility of arranging the code memory relative to the channel correlation suggests that LDPC codes have the potential to perform well on fading channels with...

متن کامل

Finding Small Stopping Sets in the Tanner Graphs of LDPC Codes

The performance of low-density parity-check (LDPC) codes over the binary erasure channel for a low erasure probability is limited by small stopping sets. The frame error rate over the additive white Gaussian noise (AWGN) channel for a high signal-to-noise ratio is limited by small trapping sets and by the minimum distance of the LDPC code, which is equal to the codeword with the minimal Hamming...

متن کامل

MIMO Wiretap Channels with Arbitrarily Varying Eavesdropper Channel States

In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO wire...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1711.03910  شماره 

صفحات  -

تاریخ انتشار 2017