Secure Nested Codes for Type II Wiretap Channels
- 1 September 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 337-342
- https://doi.org/10.1109/itw.2007.4313097
Abstract
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.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Secret Key Agreement from Correlated Source Outputs Using Low Density Parity Check MatricesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006
- On the Weight Spectrum of Good Linear Binary CodesIEEE Transactions on Information Theory, 2005
- Capacity-achieving sequences for the erasure channelIEEE Transactions on Information Theory, 2002
- Variations on the Gallager bounds, connections, and applicationsIEEE Transactions on Information Theory, 2002
- Nested linear/lattice codes for structured multiterminal binningIEEE Transactions on Information Theory, 2002
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Generalized Hamming weights for linear codesIEEE Transactions on Information Theory, 1991
- Wire-Tap Channel IIAT&T Bell Laboratories Technical Journal, 1984
- The Wire-Tap ChannelBell System Technical Journal, 1975