On codes with local joint constraints

We study the largest number of sequences with the property that any two sequences do not contain speci ed pairs of patterns. We show that this number increases exponentially with the length of the sequences and that the exponent, or capacity, is the logarithm of the joint spectral radius of an appropriately de ned set of matrices. We illustrate a new… (More)