Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1962.Vita.Includes bibliographical references (leaf 253).by Frederick Jelinek.Ph.D

Jelinek, Frederick

DSpace@MIT

Coding for discrete memoryless two-way channels

for the degree of Doctor of Philosophy. Discrete memoryless two-way channels having outputs y,y and inputs x,x are defined by their set of transmission pro-babilities p(y,y/x,x). They were first studied by Shannon who developed expressions for inner and outer bounds of the capacity region. This thesis investigates strategy codes in which messages are mapped into functions F and F, where F maps received signal sequences Y into the channel input_signal sequences X, and F maps received signal sequences Y into chan-nel input signal sequences X. First a coding theorem is developed, based on a generalization of the random argument for independent assignments, extending Shannon&apos;s inner bound to the capacity region, and showing that in this extension the probability of decoding error is exponentially bounded with in

Frederick Jelinek

CiteSeerX