Links between complexity theory and constrained block coding

The goal of this paper is to establish links between computational complexity theory and the theory and practice of constrained block coding. The complexities of several fundamental problems in constrained block coding are precisely classified in terms of the existing complexity-theoretic structure. One type of problem studied is the design of encoder and decoder circuits using minimum or approximately minimum hardware for a given constraint and rate. Another is computing the maximum rate of a block code, given the constraint and the codeword length