Maximizing the capacity of constrained systems that forbid two sequences
Navin Kashyap · 2003
We solve the problem of finding the set {A, B} /spl sub/ {0, 1}/sup m/ that maximizes, among all 2-subsets of {0, 1}/sup m/, the Shannon capacity, H(A, B), of a constrained system of binary sequences that do not contain A or B as a contiguous subsequence.