Abstract—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 ensembles of LDPC codes with block length n and girth ≥ 2k, for some k ≥ 2. We show that if the minimum left degree of the ensemble is lmin, the expected probability of block error is O ( 1 ndlmink/2e−k) when the erasure probability < ef, where ef depends on the degree distribution of the ensemble. As long as lmin> 2 and k> 2, the dual of this LDPC code provides strong secrecy over a BEWC of erasure probability greater than 1−ef. I
Abstract—The dependence-testing (DT) bound is one of the strongest achievability bounds for the bina...
Abstract—A coding scheme based on irregular low-density parity-check (LDPC) codes is proposed to sen...
In this paper, we introduce new sequences (λn, ρnλ) of capacity achieving low-density parity-check (...
Abstract—We show that duals of certain low-density parity-check (LDPC) codes, when used in a standar...
We consider code design for Wyner’s wiretap channel. Optimal coding schemes for this channel require...
International audienceWe investigate properties of finite blocklength codes and their duals when use...
The ensemble of low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes has been pro...
We consider transmission over a binary erasure wiretap channel using the code construction method in...
International audienceWith the advent of quantum key distribution (QKD) systems, perfect (i.e. infor...
The problem of secret sharing over the Gaussian wiretap channel is considered. A source and a destin...
We consider transmission over a wiretap channel where both the main channel and the wiretapper's cha...
Abstract—For certain degree-distribution pairs with non-zero fraction of degree-two bit nodes, the b...
In this work we study the reliability and secrecy performance achievable by practical low-density p...
We design and assess some practical low-density parity-check (LDPC) coded transmission schemes for ...
Abstract In this paper, we provide secrecy metrics applicable to physical-layer coding techniques wi...
Abstract—The dependence-testing (DT) bound is one of the strongest achievability bounds for the bina...
Abstract—A coding scheme based on irregular low-density parity-check (LDPC) codes is proposed to sen...
In this paper, we introduce new sequences (λn, ρnλ) of capacity achieving low-density parity-check (...
Abstract—We show that duals of certain low-density parity-check (LDPC) codes, when used in a standar...
We consider code design for Wyner’s wiretap channel. Optimal coding schemes for this channel require...
International audienceWe investigate properties of finite blocklength codes and their duals when use...
The ensemble of low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes has been pro...
We consider transmission over a binary erasure wiretap channel using the code construction method in...
International audienceWith the advent of quantum key distribution (QKD) systems, perfect (i.e. infor...
The problem of secret sharing over the Gaussian wiretap channel is considered. A source and a destin...
We consider transmission over a wiretap channel where both the main channel and the wiretapper's cha...
Abstract—For certain degree-distribution pairs with non-zero fraction of degree-two bit nodes, the b...
In this work we study the reliability and secrecy performance achievable by practical low-density p...
We design and assess some practical low-density parity-check (LDPC) coded transmission schemes for ...
Abstract In this paper, we provide secrecy metrics applicable to physical-layer coding techniques wi...
Abstract—The dependence-testing (DT) bound is one of the strongest achievability bounds for the bina...
Abstract—A coding scheme based on irregular low-density parity-check (LDPC) codes is proposed to sen...
In this paper, we introduce new sequences (λn, ρnλ) of capacity achieving low-density parity-check (...