Constructive Codes Achieving the Secrecy Capacity of Wiretap Channels

摘要

A theorem which states that constructive codes achieve any rate below the secrecy capacity for discrete memoryless wiretap channels (Wyner, 1975) is presented. The codes (or their encoders) are constructible in polynomial time.%盗聴通信路の秘密容量を達成し，かつ多項式時間で構成可能な符号を具体的に与える.盗聴通信路の定式化はWyner（1975）とCsiszar and Koerner（1978）による.