The Two-way Channel as a Computer Game
A.H.A. Bloemen, Hendrik B. Meeuwissen, J. Schalkwijk · 2005
In his 1961 paper on two-way channels (TWC'S) Shannon derived single-letter inner- and outer bounds to the capacity region. The first part of this paper is a survey of earlier results on TWC'S in general and the binary multiplying channel (BMC) in particular. The second part is devoted to a new approach to the problem of determining the capacity region of the BMC. Based on Schalkwijk's 1982 idea to represent symmetric, R1 = R2 = R, coding strategies for deterministic two-way channels as progressive subdivisions of an M x M square, we developed a computer game AXE as a development environment for new coding strategies. Playing AXE is simple and requires no background in information theory.