Rate-Equivocation Optimal Spatially Coupled LDPC Codes for the BEC Wiretap Channel

被引:0
作者
Rathi, Vishwambhar [1 ]
Urbanke, Ruediger [1 ]
Andersson, Mattias [1 ]
Skoglund, Mikael [1 ]
机构
[1] Icera, Bristol, Avon, England
来源
2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) | 2011年
关键词
CONVOLUTIONAL-CODES;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider transmission over a wiretap channel where both the main channel and the wiretapper's channel are Binary Erasure Channels (BEC). We use regular convolutional LDPC ensembles, introduced by Felstrom and Zigangirov, together with Wyner's coset encoding scheme. We show that such a construction achieves the whole rate-equivocation region of the BEC wiretap channel. This result is based on the recent observation by Kudekar, Richardson, and Urbanke who proved that convolutional LDPC ensembles exhibit a "threshold saturation" phenomenon which converts the MAP threshold into the BP threshold for transmission over the BEC. Although our present result is less general (since we only consider the BEC) than the elegant code constructions based on polar codes which were recently introduced by several research groups, we see two potential advantages which we believe makes our construction worth considering. First, the proposed codes have a significantly better performance already for moderate lengths. Second, and perhaps more importantly, the proposed construction has the potential of being universal. More precisely, the phenomenon of spatial coupling has been observed empirically to hold for general binary memoryless symmetric channels as well. Hence, we conjecture that our construction is a universal rate-equivocation achieving construction when the main channel and wiretapper's channel are binary memoryless symmetric channels, and the wiretapper's channel is degraded with respect to the main channel.
引用
收藏
页数:5
相关论文
共 23 条
[1]   Nested Polar Codes for Wiretap and Relay Channels [J].
Andersson, Mattias ;
Rathi, Vishwambhar ;
Thobaben, Ragnar ;
Kliewer, Jorg ;
Skoglund, Mikael .
IEEE COMMUNICATIONS LETTERS, 2010, 14 (08) :752-754
[2]  
[Anonymous], SECRECY ACHIEVING PO
[3]  
[Anonymous], PERFORMANCE ANAL DES
[4]   Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels [J].
Arikan, Erdal .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073
[5]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892
[6]  
Engdahl K., 1999, Problemy Peredachi Informatsii, V35, P12
[7]   Time-varying periodic convolutional codes with low-density parity-check matrix [J].
Felstrom, AJ ;
Zigangirov, KS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) :2181-2191
[8]  
KOYLUOGLU OO, 2010, POLAR CODING SECURE
[9]  
KUDEKAR S, 2010, THRESHOLD SATURATION
[10]  
Kudekar S., 2010, CORR