English
Related papers

Related papers: LDPC-Based Code Hopping for Gaussian Wiretap Chann…

200 papers

Low-density parity-check (LDPC) coding for a multitude of equal-capacity channels is studied. First, based on numerous observations, a conjecture is stated that when the belief propagation decoder converges on a set of equal-capacity…

Information Theory · Computer Science 2016-11-17 Ali Sanaei , Mahdi Ramezani , Masoud Ardakani

In this paper, we consider communication on a two-hop channel, in which a source wants to send information reliably and securely to the destination via a relay. We consider both the untrusted relay case and the external eavesdropper case.…

Information Theory · Computer Science 2015-09-15 Zhijie Ren , Jasper Goseling , Jos H. Weber , Michael Gastpar

Consider communication over a binary-input memoryless output-symmetric channel with low density parity check (LDPC) codes and maximum a posteriori (MAP) decoding. The replica method of spin glass theory allows to conjecture an analytic…

Information Theory · Computer Science 2016-11-17 Shrinivas Kudekar , Nicolas Macris

Protograph low-density-parity-check (LDPC) are considered to design near-capacity low-rate codes over the binary erasure channel (BEC) and binary additive white Gaussian noise (BIAWGN) channel. For protographs with degree-one variable nodes…

Information Theory · Computer Science 2018-05-03 Asit Kumar Pradhan , Andrew Thangaraj

We present a quantum communication protocol which keeps all the properties of the ping-pong protocol [Phys. Rev. Lett. 89, 187902 (2002)] but improves the capacity doubly as the ping-pong protocol. Alice and Bob can use the variable…

Quantum Physics · Physics 2009-11-10 Qing-yu Cai , Bai-wen Li

A modified Gradient Descent Bit Flipping (GDBF) algorithm is proposed for decoding Low Density Parity Check (LDPC) codes on the binary-input additive white Gaussian noise channel. The new algorithm, called Noisy GDBF (NGDBF), introduces a…

Information Theory · Computer Science 2014-11-27 Gopalakrishnan Sundararajan , Chris Winstead , Emmanuel Boutillon

Joint encryption-encoding schemes have been released to fulfill both reliability and security desires in a single step. Using Low Density Parity Check (LDPC) codes in joint encryption-encoding schemes, as an alternative to classical linear…

Information Theory · Computer Science 2019-02-22 Hossein Khayami , Taraneh Eghlidos , Mohammad Reza Aref

This paper considers the forward error correction (FEC) code design for approaching the capacity of a dynamic multiple access channel (MAC) where both the number of users and their respective signal powers keep constantly changing,…

Information Theory · Computer Science 2019-07-22 Xiaojie Wang , Sebastian Cammerer , Stephan ten Brink

The security of prepare-and-measure satellite-based quantum key distribution (QKD), under restricted eavesdropping scenarios, is addressed. We particularly consider cases where the eavesdropper, Eve, has limited access to the transmitted…

Multimode fibers hold great promise to advance data rates in optical communications but come with the challenge to compensate for modal crosstalk and mode-dependent losses, resulting in strong distortions. The holographic measurement of the…

We consider spatially coupled low-density parity-check (SC-LDPC) codes within a non-orthogonal interleave division multiple access (IDMA) scheme to avoid cumbersome degree profile matching of the LDPC code components to the iterative…

Information Theory · Computer Science 2019-01-29 Sebastian Cammerer , Xiaojie Wang , Yingyan Ma , Stephan ten Brink

This work concerns the behavior of "good" (capacity achieving) codes in several multi-user settings in the Gaussian regime, in terms of their minimum mean-square error (MMSE) behavior. The settings investigated in this context include the…

Information Theory · Computer Science 2015-02-26 Ronit Bustin , Rafael F. Schaefer , H. Vincent Poor , Shlomo Shamai

We present a decode-and-forward transmission scheme based on spatially-coupled low-density parity-check (SC-LDPC) codes for a network consisting of two (possibly correlated) sources, one relay, and one destination. The links between the…

Information Theory · Computer Science 2014-02-17 Stefan Schwandter , Alexandre Graell i Amat , Gerald Matz

This paper considers a Gaussian multi-input multi-output (MIMO) multiple access wiretap (MAC-WT) channel, where an eavesdropper (Eve) wants to extract the confidential information of all users. Assuming that both the legitimate receiver and…

Information Theory · Computer Science 2022-09-20 Hao Xu , Kai-Kit Wong , Giuseppe Caire

In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for…

Information Theory · Computer Science 2012-08-27 Peng Xu , Zhiguo Ding , and Xuchu Dai , Kin Leung

Polar codes have been proven to be capacity achieving for any binary-input discrete memoryless channel, while at the same time they can reassure secure and reliable transmission over the single-input single-output wireless channel. However,…

This paper presents a polar coding scheme to achieve secrecy in block fading binary symmetric wiretap channels without the knowledge of instantaneous channel state information (CSI) at the transmitter. For this model, a coding scheme that…

Information Theory · Computer Science 2015-11-05 Hongbo Si , O. Ozan Koyluoglu , Sriram Vishwanath

Secure communication in a potentially malicious environment becomes more and more important. The arbitrarily varying wiretap channel (AVWC) provides information theoretical bounds on how much information can be exchanged even in the…

Information Theory · Computer Science 2022-04-15 Carsten Rudolf Janda , Moritz Wiese , Eduard A. Jorswieck , Holger Boche

In this poster paper we present a data dissemination transmission abstraction for over the air programming (OAP) protocol which is fundamentally different from the previous hop by hop transmission protocols. Instead of imposing the greedy…

Networking and Internet Architecture · Computer Science 2017-02-09 Daniyal Ahmed , Jalaluddin Qureshi

This paper presents a general approach for optimizing the number of symbols in increments (packets of incremental redundancy) in a feedback communication system with a limited number of increments. This approach is based on a tight normal…

Information Theory · Computer Science 2016-02-17 Kasra Vakilinia , Sudarsan V. S. Ranganathan , Dariush Divsalar , Richard D. Wesel