The Two-way Channel as a Computer Game

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...

Full description

Saved in:
Bibliographic Details
Published inProceedings. IEEE International Symposium on Information Theory p. 300
Main Authors Bloemen, A.H.A., Meeuwissen, H.B., Schalkwijk, J.P.M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1993
Subjects
Boosting
Channel coding
Computer vision
History
Information theory
Paper technology
Upper bound
Visualization
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9780780308787
0780308786
DOI:10.1109/ISIT.1993.748614