Tight bound for the skew Hamming set-pair problem

Guorong Gao, Run Zhao

Let $X$ be an alphabet, let $t\ge 0$ and $n\ge t+1$, and let $((a_i,b_i){)}_{i=1}^m$ be an ordered family of word pairs in $X^n$ satisfying $dist(a_i,b_i)\ge t+1$ for every $i$…