On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel

We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive schemes, under a zero probability of error criterion. We derive inner and outer bounds on the zero-error capacity region, based on random coding, linear programming, and linear codes. Our work generalizes arguments of Holzman and Körner, and of Tolhuizen, obtained in the special case of the binary multiplying channel.