On the number of alternating paths in bipartite complete graphs

Patrick Bennett, Andrzej Dudek, Elliot Laforge

Let $C\subseteq [r{]}^m$ be a code such that any two words of $C$ have Hamming distance at least $t$. It is not difficult to see that determining a code $C$ with the maximum number…