Recently, codes that are constructible in polynomial time and achieve any rate below the secrecy capacity for wiretap channels (Wyner, 1975) were obtained by the author (the constructions themselves were presented in the IEEE ITW 2006, Chengdu, China). This result (the achievability of the secrecy capacity) would better be understood if it was viewed as an application of some fundamental result obtained by the author, i.e., a bound on 'information leakage' for codes obtained with concatenation. The aim of this report is to describe this bound (reported in an earlier IEICE technical meeting, Dec. 2009) in detail. In fact, the bound is presented in a generalized form.
展开▼
