Strong Secrecy for Erasure Wiretap Channels

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted to the Information Theory Workship (ITW) 2010, Dublin

Scientific paper

10.1109/CIG.2010.5592770

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 $\geq 2k$, for some $k \geq 2$. We show that if the minimum left degree of the ensemble is $l_\mathrm{min}$, the expected probability of block error is $\calO(\frac{1}{n^{\lceil l_\mathrm{min} k /2 \rceil - k}})$ when the erasure probability $\epsilon < \epsilon_\mathrm{ef}$, where $\epsilon_\mathrm{ef}$ depends on the degree distribution of the ensemble. As long as $l_\mathrm{min} > 2$ and $k > 2$, the dual of this LDPC code provides strong secrecy over a BEWC of erasure probability greater than $1 - \epsilon_\mathrm{ef}$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Strong Secrecy for Erasure Wiretap Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Strong Secrecy for Erasure Wiretap Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strong Secrecy for Erasure Wiretap Channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-388371

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.