Reliabilty criterion for channels with prohibitions

We investigate the possibility of reliable transmission in a situation when an adversary can prohibit some characters, and a set of prohibitions can change at every clock cycle. We show that reliable transmission is possible if and only if the cardinality of the alphabet $n$ and the number of allowed characters $k$ satisfy the inequality $n \leqslant 2k- 2$.