Subspace Decomposition of Extreme-Rate Secrecy Codes

The performance and structure of wiretap codes are analyzed in the limit of large code size and very low- or very high-rate codes. Under these conditions, code performance may be calculated using the properties of subspaces of the available code space. Using this technique, a code defined by a generator matrix with a uniform distribution of nonzero columns is proven to be locally optimal.