Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes
In this paper, the trellis representation of nonlinear codes is studied from a new perspective, We introduce the new concept of entropy/length profile (ELP), This profile can be considered as an extension of the dimension/length profile (DLP) to nonlinear codes, This elaboration of the DLP, the entropy/length profiles, appears to be suitable to the analysis of nonlinear codes, Additionally and independently, we use well-known information-theoretic measures to derive novel bounds on the minimal covering of a bipartite graph by complete subgraphs. We use these bounds in conjunction with the ELP notion to derive both lower and upper bounds on the stale complexity and branch complexity profiles of (nonlinear) block codes represented by any trellis diagram. We lay down no restrictions on the trellis structure, and we do not confine the scope of our results to proper of one-to-one trellises only, The basic lower bound on the state complexity profile implies that the state complexity at any given level cannot be smaller than the mutual information between the past and the future portions of the code at this level under a uniform distribution of the codewords, We also devise a different probabilistic model to prove that the minimum achievable state complexity over all possible trellises is not larger than the maximum value of the above mutual information over all possible probability distributions of the codewords, This approach is pursued further to derive similar bounds on the branch complexity profile, To the best of our knowledge, the proposed upper bounds are the only upper bounds that address nonlinear codes, The novel fewer bounds are tighter than the existing bounds, The new quantities and hounds reduce to well-known results when applied to linear codes.
entropy entropy/length profiles bipartite graphs trellis complexity nonlinear codes mutual information complete graphs