English
Related papers

Related papers: Secret Sharing LDPC Codes for the BPSK-constrained…

200 papers

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

The two-user multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with common, private and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to User 1 and a…

Information Theory · Computer Science 2019-05-29 Ziv Goldfeld , Haim H. Permuter

We propose a novel joint decoding technique for distributed source-channel (DSC) coded systems for transmission of correlated binary Markov sources over additive white Gaussian noise (AWGN) channels. In the proposed scheme, relatively…

Information Theory · Computer Science 2013-08-02 Reza Asvadi , Tad Matsumoto , Markku Juntti

In this chapter, we show how the use of differential coding and the presence of phase slips in the transmission channel affect the total achievable information rates and capacity of a system. By means of the commonly used QPSK modulation,…

Information Theory · Computer Science 2017-04-18 Laurent Schmalen , Stephan ten Brink , Andreas Leven

Low-density parity-check (LDPC) codes are specified by graphs, and are the error correction technique of choice in many communications and data storage contexts. Message passing decoders diffuse information carried by parity bits into the…

Information Theory · Computer Science 2023-05-02 Beyza Dabak , Ece Tiryaki , Robert Calderbank , Ahmed Hareedy

In this paper, we study an information-theoretic secret sharing problem, where a dealer distributes shares of a secret among a set of participants under the following constraints: (i) authorized sets of users can recover the secret by…

Information Theory · Computer Science 2021-11-15 Vidhi Rana , Remi A. Chou , Hyuck Kwon

In this work, an explicit wiretap coding scheme based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. Firstly, polar lattices are used to construct secrecy-good…

Information Theory · Computer Science 2017-12-27 Ling Liu , Yanfei Yan , Cong Ling

We show that duals of certain low-density parity-check (LDPC) codes, when used in a standard coset coding scheme, provide strong secrecy over the binary erasure wiretap channel (BEWC). This result hinges on a stopping set analysis of…

Information Theory · Computer Science 2010-10-26 Ananda T. Suresh , Arunkumar Subramanian , Andrew Thangaraj , Matthieu Bloch , Steven McLaughlin

Recent results have shown that structured codes can be used to construct good channel codes, source codes and physical layer network codes for Gaussian channels. For Gaussian channels with secrecy constraints, however, efforts to date rely…

Information Theory · Computer Science 2009-07-31 Xiang He , Aylin Yener

The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such that observing links in any permissible wiretap set reveals no information about the message. This paper…

Information Theory · Computer Science 2016-11-17 Tao Cui , Tracey Ho , Joerg Kliewer

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

We propose a covert communication protocol for the spread-spectrum multiple random access with additive white Gaussian noise (AWGN) channel. No existing paper has studied covert communication for the random access channel. Our protocol…

Information Theory · Computer Science 2023-10-25 Masahito Hayashi , Angeles Vazquez-Castro

This work considers the design of short non-binary low-density parity-check (LDPC) codes over finite fields of order m, for channels with phase noise. In particular, m-ary differential phase-shift keying (DPSK) modulated code symbols are…

Information Theory · Computer Science 2019-08-09 Tudor Ninacs , Balázs Matuz , Gianluigi Liva , Giulio Colavolpe

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the…

Information Theory · Computer Science 2015-03-17 Alexandre J. Pierrot , Matthieu R. Bloch

Accurate modeling of the correlation between the sources plays a crucial role in the efficiency of distributed source coding (DSC) systems. This correlation is commonly modeled in the binary domain by using a single binary symmetric channel…

Information Theory · Computer Science 2012-11-12 Mojtaba Vaezi , Fabrice Labeau

Generalized low-density parity-check (GLDPC) codes, where single parity-check (SPC) constraint nodes are replaced with generalized constraint (GC) nodes, are a promising class of codes for low latency communication. In this paper, a…

Information Theory · Computer Science 2019-10-16 Yanfang Liu , Pablo M. Olmos , David G. M. Mitchell

The basic problem of secure bidirectional relaying involves two users who want to exchange messages via an intermediate "honest-but-curious" relay node. There is no direct link between the users, all communication must take place via the…

Information Theory · Computer Science 2015-06-09 Shashank Vatedka , Navin Kashyap

In this paper, we propose how to simply construct a pair of linear codes for the BB84 quantum key distribution protocol. This protocol allows unconditional security in the presence of an eavesdropper, and the pair of linear codes is used…

Quantum Physics · Physics 2007-05-23 Maki Ohata , Kanta Matsuura

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO…

Information Theory · Computer Science 2009-10-19 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

Unequal transition probabilities between input and output symbols, input power constraints, or input symbols of unequal durations can lead to non-uniform capacity achieving input distributions for communication channels. Using uniform input…

Information Theory · Computer Science 2011-06-13 Georg Böcherer , Rudolf Mathar