TY - GEN
T1 - Secure nested codes for type II wiretap channels
AU - Liu, Ruoheng
AU - Liang, Yingbin
AU - Poor, H. Vincent
AU - Spasojević, Predrag
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and the eavesdropper channel is a general binary-input symmetric-output memoryless channel. The proposed secure error-correcting code has a nested code structure. Two secure nested coding schemes are studied for a type II Gaussian wiretap channel. The nesting is based on cosets of a good code sequence for the first scheme and on cosets of the dual of a good code sequence for the second scheme. In each case, the corresponding achievable rate-equivocation pair is derived based on the threshold behavior of good code sequences. The two secure coding schemes together establish an achievable rate-equivocation region, which almost covers the secrecy capacity-equivocation region in this case study. The proposed secure coding scheme is extended to a type II binary symmetric wiretap channel. A new achievable perfect secrecy rate, which improves upon the previously reported result by Thangaraj et al., is derived for this channel.
AB - This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and the eavesdropper channel is a general binary-input symmetric-output memoryless channel. The proposed secure error-correcting code has a nested code structure. Two secure nested coding schemes are studied for a type II Gaussian wiretap channel. The nesting is based on cosets of a good code sequence for the first scheme and on cosets of the dual of a good code sequence for the second scheme. In each case, the corresponding achievable rate-equivocation pair is derived based on the threshold behavior of good code sequences. The two secure coding schemes together establish an achievable rate-equivocation region, which almost covers the secrecy capacity-equivocation region in this case study. The proposed secure coding scheme is extended to a type II binary symmetric wiretap channel. A new achievable perfect secrecy rate, which improves upon the previously reported result by Thangaraj et al., is derived for this channel.
UR - http://www.scopus.com/inward/record.url?scp=45249114841&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=45249114841&partnerID=8YFLogxK
U2 - 10.1109/ITW.2007.4313097
DO - 10.1109/ITW.2007.4313097
M3 - Conference contribution
AN - SCOPUS:45249114841
SN - 1424415640
SN - 9781424415649
T3 - 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings
SP - 337
EP - 342
BT - 2007 IEEE Information Theory Workshop, ITW 2007, Proceedings
T2 - 2007 IEEE Information Theory Workshop, ITW 2007
Y2 - 2 September 2007 through 6 September 2007
ER -