Nonasymptotic Estimates for Efficiency of Code Jamming in a Wire-Tap Channel

In 1975, Wyner first introduced the concept of wire-tap channel, and proved a theorem regarding the permissible region of pairs (transmission rate/indeterminacy in the tap) such that the information content in the tap decreases to zero asymptotically over the code block length. In the present paper, we obtain bounds for the information content for finite block lengths. Problems of code optimization are considered.