Provided by: ICST
Date Added: May 2012
In this paper, the authors investigate the limitations of capacity-based random code constructions for the wiretap channel, i.e., constructions that associate to each confidential message a subcode whose rate approaches the capacity of the eavesdropper's channel. Generalizing a previous result for binary symmetric channels, they show that random capacity-based codes do not achieve the strong secrecy capacity over the symmetric discrete memoryless channels they were designed for. However, they also show that these codes can achieve strong secrecy rates provided they are used over degraded wiretap channels.