This article is cited in 2 papers

Part 2. Special Issues in Intellectual Systems Theory

Reliabilty criterion for channels with prohibitions

I. B. Kazakov


Abstract: 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$.

Keywords: covert channels, walks in a plane, character prohibition, transmittable language.