期刊
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
卷 6, 期 3, 页码 585-594出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIFS.2011.2148715
关键词
Binary erasure channels; density evolution; information-theoretic security; large girth; low-density parity-check (LDPC) codes; secrecy capacity; strong secrecy; wiretap channels
For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at least three, we show using density evolution analysis that the expected bit-error probability of these ensembles, when passed through a binary erasure channel with erasure probability epsilon, decays as O(exp(-c(1)n(c2))) with the block-length for positive constants c(1) and c(2), as long as epsilon is less than the erasure threshold epsilon(th) of the DDP. This guarantees that the coset coding scheme using the dual sequence provides strong secrecy over the binary erasure wiretap channel for erasure probabilities greater than 1 - epsilon(th).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据